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.

A180435 a(n) = a(n-1)*2^n+n, a(0)=1.

This page as a plain text file.
%I A180435 #8 Apr 05 2015 14:47:29
%S A180435 1,3,14,115,1844,59013,3776838,483435271,123759429384,63364827844617,
%T A180435 64885583712887818,132885675443994251275,544299726618600453222412,
%U A180435 4458903360459574912797999117,73054672657769675371282417532942
%N A180435 a(n) = a(n-1)*2^n+n, a(0)=1.
%F A180435 a(n+1) = (2^(n + 1) + 1)*a(n) - 2^n*a(n - 1) + 1.
%F A180435 a(n+1) = ((a(n - 2) + 4*a(n - 1) + 4)*a(n) - 2*a(n - 1)^2 - 4*a(n)^2 + a(n - 2) - 4*a(n - 1))/(a(n - 2) - 2*a(n - 1)).
%F A180435 a(n) = 2^(n*(n+1)/2) + sum_{k=1..n} 2^( (n+k+1)*(n-k)/2 ) * k. - _Max Alekseyev_, Sep 05 2010
%t A180435 nxt[{n_,a_}]:={n+1,a*2^(n+1)+n+1}; Transpose[NestList[nxt,{0,1},20]] [[2]] (* _Harvey P. Dale_, Apr 05 2015 *)
%o A180435 (PARI) a(n)=if(n<=0,1, a(n-1)*2^n+n )
%Y A180435 Cf. A010842.
%K A180435 nonn
%O A180435 0,2
%A A180435 _Georgi Guninski_, Sep 05 2010
%E A180435 Minor edits by _N. J. A. Sloane_, Sep 05 2010