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.

A125046 Partial sums of A003095.

This page as a plain text file.
%I A125046 #15 Dec 18 2014 08:36:38
%S A125046 0,1,3,8,34,711,459041,210066847942,44127887746116242835744,
%T A125046 1947270476915296449559747573381595046695626949,
%U A125046 3791862310265926082868235028027893277370233154194659061677030600277515827791936222020978975
%N A125046 Partial sums of A003095.
%H A125046 Vincenzo Librandi, <a href="/A125046/b125046.txt">Table of n, a(n) for n = 0..13</a>
%H A125046 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A125046 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]
%F A125046 a(n) ~ c^(2^n), where c = A076949 = 1.225902443528748538627947495913... . - _Vaclav Kotesovec_, Dec 18 2014
%t A125046 Accumulate[NestList[#^2 + 1 &, 0, 11]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 24 2012 *)
%t A125046 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 *)
%o A125046 (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
%Y A125046 Cf. A003095, A076949.
%K A125046 nonn
%O A125046 0,3
%A A125046 Jonathan Vos Post, Jan 08 2007