# Revision history [back]

Here are some hints:

• please re-read Rowland's formula, the interesting sequence is not $a(n)$ but the first difference $a(n)-a(n-1)$ !
• If you want to see some primes appearing (not only 1's), you should look for more than only the first 10 values.
• the line n=2 is useless since it is erased by the next loop
• to verify the formula, you should make a test that discards the 1's appearing, and that check and prints the other if they are prime (and raise/print an error message if not).

Here are some hints:

• please re-read Rowland's formula, the interesting sequence is not $a(n)$ but the first difference $a(n)-a(n-1)$ !$a(n)-a(n-1)$,
• If you want to see some primes appearing (not only 1's), you should look for more than only the first 10 values.values,
• the line n=2 is useless since it is erased by the next looploop,
• to verify the formula, you should make a test that discards the 1's appearing, and that check and prints the other if they are prime (and raise/print an error message if not).

Here are some hints:

• please re-read Rowland's formula, the interesting sequence is not $a(n)$ but the first difference $a(n)-a(n-1)$,
• If you want to see some primes appearing (not only 1's), you should look for more than only the first 10 values,
• the line n=2 is useless since it is erased by the next loop,loop, if you want to start at n=2 your loop should look like : for n in range(2,100):,
• what is inside your loop should be indented
• to verify the formula, you should make a test that discards the 1's appearing, and that check and prints the other if they are prime (and raise/print an error message if not).