The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A003487 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A003487

a(n) = a(n-1)^2 - 2, with a(0) = 5.
(history; published version)

#64 by Alois P. Heinz at Sun Jan 12 13:08:54 EST 2025

STATUS

reviewed

approved

#63 by Michel Marcus at Sun Jan 12 12:41:37 EST 2025

STATUS

proposed

reviewed

#62 by Andrew Howroyd at Sun Jan 12 12:35:11 EST 2025

STATUS

editing

proposed

#61 by Andrew Howroyd at Sun Jan 12 12:18:26 EST 2025

NAME

a(n) = a(n-1)^2 - 2, with a(0) = 5.

STATUS

approved

editing

#60 by Peter Luschny at Thu Dec 08 12:38:48 EST 2022

STATUS

reviewed

approved

#59 by Joerg Arndt at Thu Dec 08 11:16:58 EST 2022

STATUS

proposed

reviewed

#58 by Peter Bala at Thu Dec 08 10:20:47 EST 2022

STATUS

editing

proposed

#57 by Peter Bala at Thu Dec 08 06:11:13 EST 2022

FORMULA

a(n) = 2 + 3*Product_{k = 0 ..n-1} (a(k) + 2) for n >= 1.

#56 by Peter Bala at Wed Dec 07 12:53:37 EST 2022

FORMULA

From Peter Bala, Dec 06 2022: (Start)

Let b(n) = a(n) - 5. The sequence {b(n)} appears to be a strong divisibility sequence, that is, gcd(b(n),b(m)) = b(gcd(n,m)) for n, m >= 1. - _Peter Bala_, Dec 06 2022(End)

STATUS

proposed

editing

#55 by Peter Bala at Tue Dec 06 10:15:25 EST 2022

STATUS

editing

proposed