Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056009 (n^n + 1)/ (n^(2^a) + 1), where 2^a is the highest power of 2 dividing n. +0
3
1, 1, 7, 1, 521, 1261, 102943, 1, 38742049, 99009901, 23775972551, 429960961, 21633936185161, 56406126018061, 27368368148803711, 1, 45957792327018709121, 121065871000912423309, 98920982783015679456199 (list; graph; listen)
OFFSET

1,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

The sixth term is (6^6 +1)/ (6^(2^1) +1) = 1261, since 2^1 is highest power of 2 dividing 6.

CROSSREFS

Sequence in context: A009792 A103243 A027496 this_sequence A159252 A102771 A093954

Adjacent sequences: A056006 A056007 A056008 this_sequence A056010 A056011 A056012

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Jul 24 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research