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!)
A174632 Partial sums of A029768. 1
0, 1, 2, 4, 11, 47, 292, 2368, 23427, 272263, 3628872, 54525252, 911484163, 16775498551, 337021458884, 7338279413680, 172130372061035, 4327036966579151, 116046966039565672, 3307263639537314116 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Partial sums of number of increasing mobiles with n elements. In an increasing rooted tree, nodes are numbered and numbers increase as you move away from root. The subsequence of primes in this partial sum begins: 2, 11, 47, 272263.
LINKS
FORMULA
a(n) = SUM[i=o..n] A029768(i).
EXAMPLE
a(x) = 0 + 1 + 1 + 2 + 7 + 36 + 245 + 2076 + 21059 + 248836 = 272263 is prime.
MAPLE
S:= rhs(dsolve({diff(a(x), x) = log(1/(1-a(x)))+1, a(0)=0}, a(x), series, order=31)):
L:= [seq(coeff(S, x, j)*j!, j=0..30)]:
ListTools:-PartialSums(L); # Robert Israel, Dec 21 2017
CROSSREFS
Sequence in context: A114954 A134019 A120259 * A307592 A091240 A068488
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Mar 24 2010
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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)