|
Search: id:A109586
|
|
|
| A109586 |
|
a(n)=prime(n)^b(n), where b(n) is the Hofstadter Q-sequence: b(1)= b(2)= 1; b(n)=b(n-b(n-1))+b(n-b(n-2)) for n > 2 (A005185). |
|
+0
1
|
|
| 2, 3, 25, 343, 1331, 28561, 1419857, 2476099, 148035889, 594823321, 887503681, 3512479453921, 7984925229121, 11688200277601, 52599132235830049, 3299763591802133, 511116753300641401, 43513917611435838661
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
MAPLE
|
b:=proc(n) option remember; if n<=2 then 1 else b(n-b(n-1))+b(n-b(n-2)): fi: end: seq(ithprime(n)^b(n), n=1..20);
|
|
MATHEMATICA
|
digits = 25 Hofstadter[n_Integer?Positive] := Hofstadter[n] = Hofstadter[n - Hofstadter[n - 1]] + Hofstadter[n - Hofstadter[n - 2]] Hofstadter[0] = Hofstadter[1] = 1 a = Table[Prime[n + 1]^Hofstadter[n], {n, 0, digits - 1}]
|
|
CROSSREFS
|
Cf. A005185.
Sequence in context: A013318 A048674 A094998 this_sequence A060371 A130975 A002748
Adjacent sequences: A109583 A109584 A109585 this_sequence A109587 A109588 A109589
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 29 2005
|
|
|
Search completed in 0.002 seconds
|
