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.

A227367 a(0)=1, a(n+1) = a(0) + a(1)*a(2) + a(3)*a(4)*a(5) + a(6)*a(7)*a(8)*a(9) + ... + ...*a(n).

Original entry on oeis.org

1, 1, 2, 3, 6, 21, 381, 762, 290703, 84397476747, 7122934049104967061783, 14245868098209934123566, 101472378935797762635619628499635817245339961, 10296643686890133479148472187437767614663729545766251948487237380959682684821520304732841
Offset: 0

Views

Author

Alex Ratushnyak, Jul 08 2013

Keywords

Examples

			a(1) = a(0) = 1
a(2) = a(0) + a(1) = 2
a(3) = a(0) + a(1)*a(2) = 3
a(4) = a(0) + a(1)*a(2) + a(3) = 1 + 2 + 3 = 6
a(5) = a(0) + a(1)*a(2) + a(3)*a(4) = 1 + 2 + 18 = 21
a(6) = a(0) + a(1)*a(2) + a(3)*a(4)*a(5) = 1 + 2 + 18*21 = 381
		

Crossrefs

Programs

  • Python
    a = [1]*99
    for n in range(20):
      sum = i = 0
      k = 1
      while i<=n:
        product = 1
        for x in range(k):
          product *= a[i]
          i += 1
          if i>n: break
        sum += product
        k += 1
      a[n+1] = sum
      print(str(a[n]),end=',')