|
Search: id:A127066
|
|
|
| A127066 |
|
a(0)=1; for n>0, a(n) = a(n-1) + a(p(n)(mod n)), where p(n) is the n-th prime. |
|
+0
2
|
|
| 1, 2, 4, 8, 16, 18, 20, 28, 36, 54, 108, 162, 164, 168, 170, 174, 192, 228, 256, 364, 526, 634, 802, 972, 1200, 2002, 2974, 3776, 4748, 5550, 6522, 6530, 6538, 6556, 6564, 6618, 6646, 6700, 6862, 7024, 7192, 7366, 7534, 7898, 8126, 8354, 8528, 9500, 16030
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
The 7th prime, 17, is congruent to 3 (mod 7). So a(7) = a(6) + a(3) = 20 + 8 = 28.
|
|
MAPLE
|
a:=proc(n) if n=0 then 1 else a(n-1)+a(ithprime(n) mod n) fi end: seq(a(n), n=0..55); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 23 2007
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l]}, Append[l, l[[Mod[Prime[n], n] + 1]] + l[[ -1]]]]; Nest[f, {1}, 50] (*Chandler*)
|
|
CROSSREFS
|
Cf. A004648, A127064.
Sequence in context: A048718 A018510 A018366 this_sequence A154362 A072462 A088827
Adjacent sequences: A127063 A127064 A127065 this_sequence A127067 A127068 A127069
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Mar 21 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Mar 23 2007
|
|
|
Search completed in 0.002 seconds
|
