Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002064
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002064 Cullen numbers: n*2^n + 1.
(Formerly M2795 N1125)
+0
29
1, 3, 9, 25, 65, 161, 385, 897, 2049, 4609, 10241, 22529, 49153, 106497, 229377, 491521, 1048577, 2228225, 4718593, 9961473, 20971521, 44040193, 92274689, 192937985, 402653185, 838860801, 1744830465, 3623878657, 7516192769 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform is A084859. Inverse binomial transform is A004277. - Paul Barry (pbarry(AT)wit.ie), Jun 12 2003

REFERENCES

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. p. 255.

R. K. Guy, Unsolved Problems in Number Theory, B20.

W. Sierpi\'{n}ski, Elementary Theory of Numbers. Pa\'{n}st. Wydaw. Nauk., Warsaw, 1964, p. 346.

LINKS

T. D. Noe, Table of n, a(n) for n=0..300

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Ray Ballinger, Cullen Primes: Definition and Status

C. K. Caldwell, Cullen Primes

Paul Leyland, Factors of Cullen and Woodall numbers

Paul Leyland, Generalized Cullen and Woodall numbers

Hisanori Mishima, Factorizations of many number sequences

Hisanori Mishima, Factorizations of many number sequences

Hisanori Mishima, Factorizations of many number sequences

Hisanori Mishima, Factorizations of many number sequences

Hisanori Mishima, Factorizations of many number sequences

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

W. Sierpi\'{n}ski, Elementary Theory of Numbers, Warszawa 1964.

Wikipedia, Cullen number

FORMULA

a(n)=4a(n-1)-4a(n-2)+1. - Paul Barry (pbarry(AT)wit.ie), Jun 12 2003

a(n) = sum of row (n+1) of triangle A130197. Example: a(3) = 25 = (12 + 8 + 4 + 1), row 4 of A130197. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 16 2007

Row sums of triangle A134081. Equals A001787(n) - (2^n - 1). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 07 2007

G.f.: -(1-2*x+2*x^2)/(-1+x)/(2*x-1)^2. a(n)=A001787(n+1)+1-A000079(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 16 2007

MAPLE

A002064:=-(1-2*z+2*z**2)/(z-1)/(-1+2*z)**2; [Conjectured by S. Plouffe in his 1992 dissertation.]

CROSSREFS

Cf. A005849, A003261, A050914.

Cf. A130197.

Cf. A134081, A001787.

Adjacent sequences: A002061 A002062 A002063 this_sequence A002065 A002066 A002067

Sequence in context: A101357 A065971 A096260 this_sequence A129589 A096322 A058396

KEYWORD

nonn,easy,nice

AUTHOR

njas

page 1

Search completed in 0.003 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research