Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128093
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128093 a(n) = smallest multiple of n which is >= 2^n. +0
2
2, 4, 9, 16, 35, 66, 133, 256, 513, 1030, 2057, 4104, 8203, 16394, 32775, 65536, 131087, 262152, 524305, 1048580, 2097165, 4194322, 8388629, 16777224, 33554450, 67108886, 134217729, 268435468, 536870939, 1073741850, 2147483677 (list; graph; listen)
OFFSET

1,1

LINKS

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

FORMULA

a(n) = n * ceiling(2^n/n) = n* A053638(n)

MATHEMATICA

f[n_] := n*Ceiling[2^n/n]; Array[f, 33] (*Chandler*)

CROSSREFS

Cf. A128092, A053638.

Sequence in context: A131337 A062791 A005980 this_sequence A056331 A056336 A060401

Adjacent sequences: A128090 A128091 A128092 this_sequence A128094 A128095 A128096

KEYWORD

nonn

AUTHOR

Leroy Quet Feb 14 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 19 2007

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research