login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 26 15:13 EDT 2024. Contains 373718 sequences. (Running on oeis4.)