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!)
A051573 INVERTi transform of A000081 = [1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486,...]. 6

%I #19 Mar 28 2015 11:50:00

%S 1,1,1,2,3,8,16,41,98,250,631,1646,4285,11338,30135,80791,217673,

%T 590010,1606188,4392219,12055393,33206321,91752211,254261363,

%U 706465999,1967743066,5493195530,15367129299,43073007846,120949992543,340206026166,958444631917

%N INVERTi transform of A000081 = [1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486,...].

%H Alois P. Heinz, <a href="/A051573/b051573.txt">Table of n, a(n) for n = 0..1000</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%F a(n) ~ c * d^n / n^(3/2), where d = A051491 = 2.9557652856519949747148175241..., c = A187770 = 0.4399240125710253040409033914... . - _Vaclav Kotesovec_, Sep 06 2014

%p with(numtheory):

%p b:= proc(n) option remember; local d, j; `if` (n<2, n,

%p (add(add(d*b(d), d=divisors(j))*b(n-j), j=1..n-1))/(n-1))

%p end:

%p a:= proc(n) option remember; local i; `if`(n<0, -1,

%p -add(a(n-i) *b(i+1), i=1..n+1))

%p end:

%p seq(a(n), n=0..40); # _Alois P. Heinz_, May 17 2013

%t b[n_] := b[n] = If[n < 2, n, Sum[Sum[d*b[d], {d, Divisors[j]}]*b[n-j], {j, 1, n-1}]/(n-1)]; a[n_] := a[n] = If[n < 0, -1, -Sum[a[n-i]*b[i+1], {i, 1, n+1}]]; Table[a[n], {n, 0, 40}] (* _Jean-François Alcover_, Apr 16 2014, after _Alois P. Heinz_ *)

%Y Cf. A052250, A000081.

%K nonn

%O 0,4

%A _N. J. A. Sloane_

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 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)