login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A169652 a(1) = 5, a(n) = square of sum of previous terms. 3

%I

%S 5,25,900,864900,749661588900,561993796031809299372900,

%T 315837026779085485103717848762253067469831416900,

%U 99753027484652761836825641888570160231510113731744254964202314837133807826801896930564374920900

%N a(1) = 5, a(n) = square of sum of previous terms.

%C sqrt(a(n+1)/a(n)) = A144780(n).

%H Indranil Ghosh, <a href="/A169652/b169652.txt">Table of n, a(n) for n = 1..11</a>

%F a(n+1) = [Sum_{i=1..n}{a(i)}]^2, with a(1)=5. [_Paolo P. Lava_, Apr 23 2010]

%p P:=proc(i) local a,s,n; print(5); s:=5; for n from 0 by 1 to i do a:=s^2; print(a); s:=s+a; od; end: P(100); # _Paolo P. Lava_, Apr 23 2010

%t lst={5};Do[AppendTo[lst,Total[lst]^2],{10}];lst (* _Harvey P. Dale_, Sep 28 2012 *)

%o (Python)

%o #Program to generate the b-file

%o lst=[5]

%o print("1 5")

%o i=2

%o a=sum(lst)**2

%o while i<=11:

%o print(str(i)+" "+str(a))

%o lst.append(a)

%o i+=1

%o a=sum(lst)**2 # _Indranil Ghosh_, Feb 20 2017

%Y Cf. A144780

%K easy,nonn

%O 1,1

%A _Giovanni Teofilatto_, Apr 05 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 08:10 EDT 2021. Contains 347577 sequences. (Running on oeis4.)