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

 

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

%I #47 Mar 17 2024 02:15:32

%S 1,1,4,36,1764,3261636,10650053687364,113423713055411194304049636,

%T 12864938683278671740537145884937248491231415124195364

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

%C a(n) divides a(n+1) with result a square.

%C Except for first two terms, partial sum k of a(n) is divisible by 6.

%C These numbers are divisible by their digital roots, which makes the sequence a subsequence of A064807. - _Ivan N. Ianakiev_, Oct 09 2013

%C a(n) is the number of binary trees in which the nodes are labeled by nonnegative integer heights, the left and right children of each node (if present) must have smaller height, and the root has height n-2. For instance, there are four trees with root height 1: the left and right children of the root may or may not be present, and must each be at height 0 if present. - _David Eppstein_, Oct 25 2018

%H Vincenzo Librandi, <a href="/A174864/b174864.txt">Table of n, a(n) for n = 1..13</a>

%H <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>

%F a(n+1) = (a(n) + sqrt(a(n)))^2 = a(n) * (sqrt(a(n)) + 1)^2 for n > 1. - _Charles R Greathouse IV_, Jun 30 2011

%F a(n) = A000058(n-1) - A000058(n-2), n>=2. - _Ivan N. Ianakiev_, Oct 09 2013

%F a(n+2) + 1 = ( A000058(n+1)^2+1 ) / ( A000058(n)^2+1 ). - _Bill Gosper_, _Hugo Pfoertner_, May 09 2021

%t t = {1}; Do[AppendTo[t, Total[t]^2], {n, 9}]; t (* _Vladimir Joseph Stephan Orlovsky_, Feb 24 2012 *)

%t Join[{1},FoldList[(#+Sqrt[#])^2&,1,Range[7]]] (* _Ivan N. Ianakiev_, May 08 2015 *)

%o (PARI) a=vector(10);a[1]=a[2]=1;for(n=3,#a,a[n]=a[n-1]*(sqrtint(a[n-1])+1)^2);a

%Y Cf. A000058, A007018.

%K easy,nonn,changed

%O 1,3

%A _Giovanni Teofilatto_, Mar 31 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:46 EDT 2024. Contains 371241 sequences. (Running on oeis4.)