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.

Showing 1-1 of 1 results.

A376767 a(1) = 1; thereafter, a(n) = c*a(n-1)^2 + a(n-1), where c=4 if n is even, c=2 if n is odd.

Original entry on oeis.org

1, 5, 55, 12155, 295500205, 349281484915668305, 243995111409788451714836854478814355, 238134457567500314773144369878965950377595240310563734057802960695078455
Offset: 1

Views

Author

N. J. A. Sloane, Nov 03 2024

Keywords

Comments

Used to construct A376768.

Examples

			a(3) = 2*a(2)^2 + a(2) = 55.
		

Crossrefs

Cf. A376768.

Programs

  • Mathematica
    Module[{n = 1}, NestList[If[OddQ[++n], 2, 4]*#^2 + # &, 1, 8]] (* Paolo Xausa, Dec 16 2024 *)
Showing 1-1 of 1 results.