[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A199592 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Generalized Fermat numbers: 11^(2^n) + 1, n >= 0.
(history; published version)
#17 by Joerg Arndt at Mon Oct 03 04:19:32 EDT 2022
STATUS

reviewed

approved

#16 by Michel Marcus at Mon Oct 03 03:32:44 EDT 2022
STATUS

proposed

reviewed

#15 by Amiram Eldar at Mon Oct 03 03:29:56 EDT 2022
STATUS

editing

proposed

#14 by Amiram Eldar at Mon Oct 03 03:21:08 EDT 2022
LINKS

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GeneralizedFermatNumber.html">Generalized Fermat Number</a>.

OEIS Wiki, <a href="/wiki/Generalized_Fermat_numbers">Generalized Fermat numbers</a>.

FORMULA

a(0) = 12, a(1) = 122; a(n) = a(n-1) + 10*11^(2^(n-1))*product_Product_{i=0..n-2} a(i), n >= 2.

a(0) = 12; a(n) = 10*(product_Product_{i=0..n-1} a(i)) + 2, n >= 1.

#13 by Amiram Eldar at Mon Oct 03 03:20:37 EDT 2022
FORMULA

Sum_{n>=0} 2^n/a(n) = 1/10. - Amiram Eldar, Oct 03 2022

STATUS

approved

editing

#12 by Charles R Greathouse IV at Thu Sep 08 08:46:00 EDT 2022
PROG

(MAGMAMagma) [11^2^n+1 : n in [0..6]]

Discussion
Thu Sep 08
08:46
OEIS Server: https://oeis.org/edit/global/2944
#11 by Russ Cox at Sat Mar 31 10:24:06 EDT 2012
AUTHOR

_Arkadiusz Wesolowski (wesolowski(AT)aol.pl), _, Nov 08 2011

Discussion
Sat Mar 31
10:24
OEIS Server: https://oeis.org/edit/global/403
#10 by T. D. Noe at Tue Nov 08 16:17:48 EST 2011
STATUS

proposed

approved

#9 by Arkadiusz Wesolowski at Tue Nov 08 14:45:47 EST 2011
STATUS

editing

proposed

#8 by Arkadiusz Wesolowski at Tue Nov 08 14:43:25 EST 2011
FORMULA

a(0) = 12; a(n) = 2 + 10*(product_{i=0..n-1} a(i), ) + 2, n >= 1.