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.

A377596 a(n) = (a(n-1) + a(n-2))^5 for n>=2 where a(0) = 0, a(1) = 1.

Original entry on oeis.org

0, 1, 1, 32, 39135393, 91801604643057285538237803582587890625
Offset: 0

Views

Author

Lyle Blosser, Nov 29 2024

Keywords

Comments

A second quintic Fibonacci sequence; compare to A112980.
a(6) contains 190 digits and is too large to display here.

Examples

			a(3) = 32 = (1+1)^5 = A112980(3)^5.
		

Crossrefs

Programs

  • Mathematica
    Module[{a, n}, RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == (a[n-1] + a[n-2])^5}, a, {n, 6}]] (* or *)
    A377596[n_] := If[n < 2, n, (A377596[n-1] + A377596[n-2])^5];
    Array[A377596, 7, 0] (* Paolo Xausa, Nov 30 2024 *)

Formula

a(n) = (a(n-1) + a(n-2))^5.
a(n) = A112980(n)^5.
Showing 1-1 of 1 results.