|
|
A116524
|
|
a(0)=1, a(1)=1, a(n) = 13*a(n/2) for n=2,4,6,..., a(n) = 12*a((n-1)/2) + a((n+1)/2) for n=3,5,7,....
|
|
2
|
|
|
0, 1, 13, 25, 169, 181, 325, 469, 2197, 2209, 2353, 2497, 4225, 4369, 6097, 7825, 28561, 28573, 28717, 28861, 30589, 30733, 32461, 34189, 54925, 55069, 56797, 58525, 79261, 80989, 101725, 122461, 371293, 371305, 371449, 371593, 373321
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The Harborth : f(2^k)=3^k suggests that a family of sequences of the form: f(2^k)=Prime[n]^k There does indeed seem to be an infinite family of such functions.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
a:=proc(n) if n=0 then 0 elif n=1 then 1 elif n mod 2 = 0 then 13*a(n/2) else 12*a((n-1)/2)+a((n+1)/2) fi end: seq(a(n), n=0..40);
|
|
MATHEMATICA
|
b[0] := 0; b[1] := 1; b[n_?EvenQ] := b[n] = 13*b[n/2]; b[n_?OddQ] := b[n] = 12*b[(n - 1)/2] + b[(n + 1)/2]; a = Table[b[n], {n, 1, 25}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|