cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A174632 Partial sums of A029768.

Original entry on oeis.org

0, 1, 2, 4, 11, 47, 292, 2368, 23427, 272263, 3628872, 54525252, 911484163, 16775498551, 337021458884, 7338279413680, 172130372061035, 4327036966579151, 116046966039565672, 3307263639537314116
Offset: 0

Views

Author

Jonathan Vos Post, Mar 24 2010

Keywords

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.

Examples

			a(x) = 0 + 1 + 1 + 2 + 7 + 36 + 245 + 2076 + 21059 + 248836 = 272263 is prime.
		

Crossrefs

Programs

  • 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

Formula

a(n) = SUM[i=o..n] A029768(i).