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!)
A342615 a(0) = 0, a(1) = 1; a(2*n) = 9*a(n), a(2*n+1) = a(n) + a(n+1). 5

%I #10 May 04 2023 19:06:10

%S 0,1,9,10,81,19,90,91,729,100,171,109,810,181,819,820,6561,829,900,

%T 271,1539,280,981,919,7290,991,1629,1000,7371,1639,7380,7381,59049,

%U 7390,7461,1729,8100,1171,2439,1810,13851,1819,2520,1261,8829,1900,8271,8209,65610,8281,8919,2620

%N a(0) = 0, a(1) = 1; a(2*n) = 9*a(n), a(2*n+1) = a(n) + a(n+1).

%H Robert Israel, <a href="/A342615/b342615.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: x * Product_{k>=0} (1 + 9*x^(2^k) + x^(2^(k+1))).

%p N:= 100: # for a(0) to a(N)

%p g:= x*mul(1+9*x^(2^k)+x^(2^(k+1)),k=0..ilog2(N)):

%p S:= series(g,x,N+1):

%p seq(coeff(S,x,i),i=0..N); # _Robert Israel_, May 04 2023

%t a[0] = 0; a[1] = 1; a[n_] := If[EvenQ[n], 9 a[n/2], a[(n - 1)/2] + a[(n + 1)/2]]; Table[a[n], {n, 0, 51}]

%t nmax = 51; CoefficientList[Series[x Product[(1 + 9 x^(2^k) + x^(2^(k + 1))), {k, 0, Floor[Log[2, nmax]] + 1}], {x, 0, nmax}], x]

%Y Cf. A002487, A178569, A178590, A237711, A244643, A342610, A342611, A342614.

%K nonn,look

%O 0,3

%A _Ilya Gutkovskiy_, Mar 16 2021

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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)