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!)
A359500 a(n) = (7^2^n - 1)/2^(n+3). 1
3, 75, 90075, 259632270075, 4314170602515315024630075, 2382344702413741601833152075318304337413311121350075, 1452944967966417671787414728262962471027692106596483349510252251060925112718067382475349181570930962790075 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n)/a(n-1) = (7^2^(n-1) + 1)/2 = 2^(n+1) * a(n-1) + 1.
For all n > m, a(n) and a(m) are congruent modulo 2^(m+2) but not modulo 2^(m+3).
PROG
(PARI) a(n) = (7^2^n - 1)/2^(n+3)
(Python)
def A359500(n): return 7**(1<<n)-1>>n+3 # Chai Wah Wu, Jan 15 2023
CROSSREFS
Cf. {odd part of m^2^n - 1}: A068531 (m=3 or m=9), A097421 (m=5), this sequence (m=7).
Sequence in context: A183290 A336062 A320306 * A238000 A308866 A089301
KEYWORD
nonn,easy
AUTHOR
Jianing Song, Jan 03 2023
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 May 4 00:31 EDT 2024. Contains 372225 sequences. (Running on oeis4.)