The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A342634 a(0) = 0, a(1) = 1; a(2*n) = a(n), a(2*n+1) = 4*a(n) + a(n+1). 9
0, 1, 1, 5, 1, 9, 5, 21, 1, 13, 9, 41, 5, 41, 21, 85, 1, 17, 13, 61, 9, 77, 41, 169, 5, 61, 41, 185, 21, 169, 85, 341, 1, 21, 17, 81, 13, 113, 61, 253, 9, 113, 77, 349, 41, 333, 169, 681, 5, 81, 61, 285, 41, 349, 185, 761, 21, 253, 169, 761, 85, 681, 341, 1365, 1, 25, 21, 101, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
G.f.: x * Product_{k>=0} (1 + x^(2^k) + 4*x^(2^(k+1))).
a(n) == 1 (mod 4) for n >= 1. - Hugo Pfoertner, Mar 17 2021
MAPLE
a:= proc(n) option remember; `if`(n<2, n, (q->
`if`(d=1, 4*a(q)+a(q+1), a(q)))(iquo(n, 2, 'd')))
end:
seq(a(n), n=0..68); # Alois P. Heinz, Mar 17 2021
MATHEMATICA
a[0] = 0; a[1] = 1; a[n_] := If[EvenQ[n], a[n/2], 4 a[(n - 1)/2] + a[(n + 1)/2]]; Table[a[n], {n, 0, 68}]
nmax = 68; CoefficientList[Series[x Product[(1 + x^(2^k) + 4 x^(2^(k + 1))), {k, 0, Floor[Log[2, nmax]] + 1}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A207873 A198671 A129343 * A010482 A135856 A097414
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 17 2021
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 5 18:30 EDT 2024. Contains 373107 sequences. (Running on oeis4.)