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.

A139244 a(0) = 4; a(n) = a(n-1)^2 - 1.

Original entry on oeis.org

4, 15, 224, 50175, 2517530624, 6337960442777829375, 40169742574216538983356186036612890624, 1613608218478824775913354216413699241125577233045500390244103887844987109375
Offset: 0

Views

Author

Jonathan Vos Post, Jun 06 2008

Keywords

Comments

This is the next analog of A003096 with different initial value a(0), as starting with a(0) = 2 is A003096 and a(0) = 3 is A003096 with first term omitted. It alternates between even and odd values, specifically between 4 mod 10 and 5 mod 10 and is always composite (by difference of squares factorization).
a(n+2) is divisible by a(n)^2. A007814(a(2 n)) = A153893(n). - Robert Israel, Jul 20 2015

Crossrefs

Programs

Formula

a(n-1) = ceiling(c^(2^n)) where c is a constant between 1 and 2.
More specifically, c=1.9668917617901763653335057202... (sequence A260315). - Chayim Lowen, Jul 17 2015
Showing 1-1 of 1 results.