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.

A143762 a(n+1) = a(n)^2 + n*a(n) + n^2, a(1) = 1.

Original entry on oeis.org

1, 3, 19, 427, 184053, 33876427099, 1147612313197120118431, 1317014021401644919149757309088631306730827, 1734525932568532421128602190712731410907662021613907396581559184320372648524685950609
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 01 2008

Keywords

Comments

Let f(n+1,k) = f(n,k)^2 + k*n*f(n,k) + n^2, f(1, k) = 1:
f(n,0)=A143760(n), f(n,-1)=A143761(n), f(n,+1)=a(n),
f(n,-2)=A143763(n), f(n,+2)=A143764(n), f(n,-3)=A143765(n),
f(n,+3)=A143766(n).

Programs

  • Mathematica
    RecurrenceTable[{a[n+1] == a[n]^2 + n*a[n] + n^2, a[1] == 1}, a, {n, 1, 10}] (* Vaclav Kotesovec, Dec 18 2014 *)
    nxt[{n_, a_}] := {n + 1, a^2 + n*a + n^2}; NestList[nxt,{1,1},10][[All,2]] (* Harvey P. Dale, Sep 12 2018 *)

Formula

a(n) ~ c^(2^n), where c = 1.460594463210996899745335217057197049886968082959330102210304982704405107261... . - Vaclav Kotesovec, Dec 18 2014