|
Search: id:A127064
|
|
|
| A127064 |
|
a(0)=1. a(n) = a(p(n)(mod n)) + 1, where p(n) is the n-th prime. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 3, 3, 5, 5, 4, 5, 5, 3, 4, 3, 4, 4, 6, 6, 6, 6, 6, 5, 4, 7, 6, 5, 6, 5, 6, 5, 5, 5, 4, 5, 5, 6, 5, 6, 6, 5, 5, 5, 7, 7, 7, 5, 5, 6, 6, 7, 7, 6, 7, 6, 6, 7, 6, 7, 6, 6, 7, 8, 7, 7, 8, 8, 8, 9, 4, 5, 5, 6, 4, 5, 6, 5, 6, 6, 4, 5, 4, 6, 5, 5, 4, 5, 4, 7, 5, 5, 4, 7, 6, 7, 8, 5, 8, 6, 6, 6, 6, 6, 7, 7
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
The 7th prime, 17, is congruent to 3 (mod 7). So a(7) = a(3) + 1 = 4 + 1 = 5.
|
|
MAPLE
|
a[0]:=1: for n from 1 to 125 do a[n]:=1+a[ithprime(n) mod n] od: seq(a[n], n=0..125); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 25 2007
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l]}, Append[l, l[[Mod[Prime[n], n] + 1]] + 1]]; Nest[f, {1}, 105] (*Chandler*)
|
|
CROSSREFS
|
Cf. A004648, A127066.
Sequence in context: A053626 A134364 A104413 this_sequence A117607 A088492 A025492
Adjacent sequences: A127061 A127062 A127063 this_sequence A127065 A127066 A127067
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Mar 21 2007
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 25 2007
|
|
|
Search completed in 0.002 seconds
|
