|
Search: id:A136188
|
|
| |
|
| 3, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
As 2^(2^n)+1=5 (mod 9) for odd values of n and 2^(2^n)+1=8 (mod 9) for even values of n>0, it follows that the digital roots of the Fermat numbers form a cyclic sequence, with the 5's corresponding to odd values of n and the 8's to even values of n.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Digital Root.
Eric Weisstein's World of Mathematics, Fermat Number.
|
|
FORMULA
|
a(n)=DR(A000215(n))=A010888(A000215(n))
|
|
EXAMPLE
|
The fourth Fermat number is F(3)=257. This has digital root 5 and hence a(3)=5
|
|
MATHEMATICA
|
FermatNumber[n_]:=2^(2^n)+1; DigitalRoot[n_]:=FixedPoint[Plus@@IntegerDigits[ # ]&, n]; DigitalRoot/@(FermatNumber[ # ] &/@Range[0, 25])
|
|
CROSSREFS
|
Cf. A000215, A010888, A135928.
Sequence in context: A020864 A152304 A021902 this_sequence A073334 A021740 A110641
Adjacent sequences: A136185 A136186 A136187 this_sequence A136189 A136190 A136191
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
Ant King (mathstutoring(AT)ntlworld.com), Dec 24 2007
|
|
|
Search completed in 0.002 seconds
|
