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!)
A342637 a(0) = 0, a(1) = 1; a(2*n) = a(n), a(2*n+1) = 8*a(n) + a(n+1). 9
0, 1, 1, 9, 1, 17, 9, 73, 1, 25, 17, 145, 9, 145, 73, 585, 1, 33, 25, 217, 17, 281, 145, 1169, 9, 217, 145, 1233, 73, 1169, 585, 4681, 1, 41, 33, 289, 25, 417, 217, 1753, 17, 417, 281, 2393, 145, 2329, 1169, 9361, 9, 289, 217, 1881, 145, 2393, 1233, 9937, 73, 1753, 1169, 9937, 585 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
G.f.: x * Product_{k>=0} (1 + x^(2^k) + 8*x^(2^(k+1))).
a(n) == 1 (mod 8) for n >= 1. - Hugo Pfoertner, Mar 17 2021
MAPLE
a:= proc(n) option remember; `if`(n<2, n, (q->
`if`(d=1, 8*a(q)+a(q+1), a(q)))(iquo(n, 2, 'd')))
end:
seq(a(n), n=0..60); # Alois P. Heinz, Mar 17 2021
MATHEMATICA
a[0] = 0; a[1] = 1; a[n_] := If[EvenQ[n], a[n/2], 8 a[(n - 1)/2] + a[(n + 1)/2]]; Table[a[n], {n, 0, 60}]
nmax = 60; CoefficientList[Series[x Product[(1 + x^(2^k) + 8 x^(2^(k + 1))), {k, 0, Floor[Log[2, nmax]] + 1}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A349143 A014721 A054018 * A010170 A317051 A013616
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 April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)