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!)
A342636 a(0) = 0, a(1) = 1; a(2*n) = a(n), a(2*n+1) = 7*a(n) + a(n+1). 9
0, 1, 1, 8, 1, 15, 8, 57, 1, 22, 15, 113, 8, 113, 57, 400, 1, 29, 22, 169, 15, 218, 113, 799, 8, 169, 113, 848, 57, 799, 400, 2801, 1, 36, 29, 225, 22, 323, 169, 1198, 15, 323, 218, 1639, 113, 1590, 799, 5601, 8, 225, 169, 1296, 113, 1639, 848, 5993, 57, 1198, 799, 5993, 400, 5601, 2801 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
G.f.: x * Product_{k>=0} (1 + x^(2^k) + 7*x^(2^(k+1))).
MAPLE
a:= proc(n) option remember; `if`(n<2, n, (q->
`if`(d=1, 7*a(q)+a(q+1), a(q)))(iquo(n, 2, 'd')))
end:
seq(a(n), n=0..62); # Alois P. Heinz, Mar 17 2021
MATHEMATICA
a[0] = 0; a[1] = 1; a[n_] := If[EvenQ[n], a[n/2], 7 a[(n - 1)/2] + a[(n + 1)/2]]; Table[a[n], {n, 0, 62}]
nmax = 62; CoefficientList[Series[x Product[(1 + x^(2^k) + 7 x^(2^(k + 1))), {k, 0, Floor[Log[2, nmax]] + 1}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A173988 A349123 A158893 * A332941 A107929 A040071
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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)