Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122000 ((2^n - 1)^(2^n - 1) + 1) / 2^n = A014566[2^n - 1] / 2^n = A081216[2^n - 1]. +0
4
1, 7, 102943, 27368368148803711, 533411691585101123706582594658103586126397951, 35667661929213600778109455052682112875127972612889208410930436417698080830469396\ 18603793791988232043305924036607 (list; graph; listen)
OFFSET

1,2

COMMENT

A014566[n] = n^n + 1 is Sierpinski Number of the First Kind. A014566[2^n - 1] is divisible by 2^n. a(n) is a subset of A081216[n] = (n^n-(-1)^n)/(n+1).

2^p - 1 divides a(p-1) for prime p>2. Corresponding quotients are a(p-1) / (2^p - 1) = {1, 882850585445281, 28084773172609134470952326813135521948919663474715912134590894817085103016117634792155856629828598766188378241, ...}, where p = Prime[n] for n>1. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 22 2007

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. Sierpinski Number of the First Kind.

FORMULA

a(n) = ((2^n - 1)^(2^n - 1) + 1) / 2^n. a(n) = A014566[2^n - 1] / 2^n. a(n) = A081216[2^n - 1]. a(n) = A056009[2^n - 1].

MATHEMATICA

Table[((2^n-1)^(2^n-1)+1)/2^n, {n, 1, 7}]

CROSSREFS

Cf. A014566, A081216, A056009.

Sequence in context: A123062 A110719 A158816 this_sequence A090769 A013842 A145322

Adjacent sequences: A121997 A121998 A121999 this_sequence A122001 A122002 A122003

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 11 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research