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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276257 a(1) = a(2) = a(3) = a(4) = 1; for n>4, a(n) = ( a(n-1)+a(n-2)+a(n-3)+1 )^2 / a(n-4). 1
 1, 1, 1, 1, 16, 361, 143641, 20741472361, 26888415586959536281, 2002733778095476250641191709976062096, 27923382501685315585533445603599269911720565853675615809277429923281 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS All terms are perfect squares. The next term (a(12)) has 125 digits. - Harvey P. Dale, Jul 04 2019 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..15 FORMULA a(n) = A276259(n)^2 a(n) = 25*a(n-1)*a(n-2)*a(n-3) - 2*a(n-1) - 2*a(n-2) - 2*a(n-3) - 2 - a(n-4). a(n)*a(n-1)*a(n-2)*a(n-3) = ((a(n) + a(n-1) + a(n-2) + a(n-3) + 1)/5)^2. MATHEMATICA RecurrenceTable[{a[1]==a[2]==a[3]==a[4]==1, a[n]==(a[n-1]+a[n-2]+ a[n-3]+ 1)^2/a[n-4]}, a, {n, 11}] (* Harvey P. Dale, Jul 04 2019 *) CROSSREFS Cf. A276097, A276256, A276259. Sequence in context: A034673 A000488 A025759 * A276097 A265476 A008427 Adjacent sequences: A276254 A276255 A276256 * A276258 A276259 A276260 KEYWORD nonn AUTHOR Seiichi Manyama, Aug 25 2016 STATUS approved

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.

Last modified August 2 19:53 EDT 2024. Contains 374875 sequences. (Running on oeis4.)