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!)
A056009 a(n) = (n^n + 1)/ (n^(2^a) + 1), where 2^a is the highest power of 2 dividing n. 3
1, 1, 7, 1, 521, 1261, 102943, 1, 38742049, 99009901, 23775972551, 429960961, 21633936185161, 56406126018061, 27368368148803711, 1, 45957792327018709121, 121065871000912423309, 98920982783015679456199 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
The sixth term is (6^6 + 1)/ (6^(2^1) + 1) = 1261, since 2^1 is highest power of 2 dividing 6.
MATHEMATICA
Array[(#^# + 1)/(#^(2^IntegerExponent[#, 2]) + 1) &, 19] (* Michael De Vlieger, Dec 11 2017 *)
CROSSREFS
Sequence in context: A009792 A103243 A027496 * A159252 A357389 A245329
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Jul 24 2000
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 July 12 21:54 EDT 2024. Contains 374257 sequences. (Running on oeis4.)