The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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 Robert Israel, Table of n, a(n) for n = 0..416 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 Cf. A029768, A032220, A038037, A055356. Sequence in context: A114954 A134019 A120259 * A307592 A091240 A068488 Adjacent sequences:  A174629 A174630 A174631 * A174633 A174634 A174635 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 21:45 EDT 2020. Contains 336213 sequences. (Running on oeis4.)