login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332203 a(n) = 2^(2^n-1) + 1. 1
2, 3, 9, 129, 32769, 2147483649, 9223372036854775809, 170141183460469231731687303715884105729, 57896044618658097711785492504343953926634992332820282019728792003956564819969 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
All terms > 2 are divisible by 3. Moreover, the exponent of the highest power of 3 dividing a(n) behaves like a mixture of 2- and 3-adic ruler function, after the initial 0: (1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, ...) = A332202.
LINKS
FORMULA
a(n) = A000051(A000225(n)) = 2^A000225(n) + 1 = A077585(n) + 2.
PROG
(PARI) apply( {A332203(n)=1<<(1<<n-1)+1}, [0..9])
CROSSREFS
Cf. A077585 (Double Mersenne numbers: same with -1), A000225 (Mersenne numbers 2^n-1).
Sequence in context: A132537 A333474 A251543 * A350777 A248236 A319157
KEYWORD
nonn
AUTHOR
M. F. Hasler, Mar 05 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 07:22 EDT 2024. Contains 371782 sequences. (Running on oeis4.)