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.

A277110 a(n) = A066048(a(n-1) + a(n-2)) with a(0) = 0 and a(1) = 1.

Original entry on oeis.org

0, 1, 1, 4, 25, 841, 866, 1707, 2573, 214, 2787, 9006001, 6898, 1099, 7997, 758, 515, 1273, 298, 2468041, 2468339, 5674, 2474013, 13853, 2487866, 5357, 2493223, 1322, 498909, 250231053361, 7149472922, 203937, 420569227, 1581854, 9201, 1591055, 94, 13371, 13465, 13418, 309, 371, 34, 15, 49, 4, 2809
Offset: 0

Views

Author

Altug Alkan, Feb 09 2017

Keywords

Comments

The sequence enters a cycle after 1440 terms.
7833343487493084437^2 is the largest term of this sequence.

Examples

			a(4) = 25 because A066048(1 + 4) = A066048(5) = 25.
		

Crossrefs

Formula

a(n) = a(n+480) for n > 1440.