A125046 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A125046

Partial sums of A003095.

0, 1, 3, 8, 34, 711, 459041, 210066847942, 44127887746116242835744, 1947270476915296449559747573381595046695626949, 3791862310265926082868235028027893277370233154194659061677030600277515827791936222020978975

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..13

Index entries for sequences of form a(n+1)=a(n)^2 + ...

FORMULA

a(n) = a(n-1)^2 - 2a(n-1)a(n-2)+a(n-2)^2 + a(n-1) + 1 for n > 1. [Charles R Greathouse IV, Dec 29 2011]

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

MATHEMATICA

Accumulate[NestList[#^2 + 1 &, 0, 11]] (* Vladimir Joseph Stephan Orlovsky, Feb 24 2012 *)

RecurrenceTable[{a[0]==0, a[1]==1, a[n] == a[n-1]^2 - 2*a[n-1]*a[n-2]+a[n-2]^2 + a[n-1] + 1}, a, {n, 0, 10}] (* Vaclav Kotesovec, Dec 18 2014 *)

PROG

(PARI) a(n)=if(n>1, a(n-1)^2-2*a(n-1)*a(n-2)+a(n-2)^2+a(n-1)+1, n) \\ Charles R Greathouse IV, Dec 29 2011

CROSSREFS

Cf. A003095, A076949.

Sequence in context: A186517 A094448 A063805 * A270378 A218154 A349968

Adjacent sequences: A125043 A125044 A125045 * A125047 A125048 A125049

KEYWORD

nonn

AUTHOR

Jonathan Vos Post, Jan 08 2007

STATUS

approved