login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A096319
Given the number wheel 0,1,2,3,4,5,6,7,8,9 then starting with 0, the next number is a prime p number of positions from the previous number found, for p=2,3,...
1
2, 5, 0, 7, 8, 1, 8, 7, 0, 9, 0, 7, 8, 1, 8, 1, 0, 1, 8, 9, 2, 1, 4, 3, 0, 1, 4, 1, 0, 3, 0, 1, 8, 7, 6, 7, 4, 7, 4, 7, 6, 7, 8, 1, 8, 7, 8, 1, 8, 7, 0, 9, 0, 1, 8, 1, 0, 1, 8, 9, 2, 5, 2, 3, 6, 3, 4, 1, 8, 7, 0, 9, 6, 9, 8, 1, 0, 7, 8, 7, 6, 7, 8, 1, 0, 3, 2, 9, 0, 3, 0, 9, 6, 7, 6, 9, 8, 9, 2, 3, 0, 7, 0, 9, 0
OFFSET
0,1
COMMENTS
Conjecture: This sequence carried to infinity is non-repeating and non-terminating. If we concatenate the numbers and introduce a decimal point somewhere, we will get an irrational number.
FORMULA
n=0, n = (n mod 10 + p)%10 where p is prime = 2, 3, 5...
EXAMPLE
Imagine a number wheel 0,1,2,3,4,5,6,7,8,9 like the numbers on an odometer. The first number in the wheel is 0. Counting from 0, the next number is 2 positions beyond 0 which is 2; counting 3 positions from 2, we get 5; counting 5 positions from 5 (when we hit 9, we go to 0) we get 0. 2,5,0 are the first 3 terms in the table.
PROG
(PARI) = number max of p, m = starting position. wheel(n, m) = { x=m; forprime(p=2, n, x=(x%10+p)%10; print1(x", ") ) }
CROSSREFS
Sequence in context: A011184 A157214 A066033 * A146105 A331165 A022832
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Aug 02 2004
STATUS
approved