Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133814
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133814 Smallest primitive abundant number or perfect number with 2^n as a factor. +0
1
945, 6, 20, 88, 272, 1184, 4288, 16768, 65792, 266752 (list; graph; listen)
OFFSET

0,1

EXAMPLE

945=3^3*5*7 least primitive abundant number with no factor 2, a(0)=945

6=2*3 perfect number, a(1)=6

20=2^2*5 primitive abundant number < 28=2^2*7 perfect number, a(2)=20

88=2^3*11

272=2^4*17

1184=2^5*37

4288=2^6*67

16768=2^7*131

65792=2^8*257

266752=2^9*521

CROSSREFS

Sequence in context: A052238 A104302 A106431 this_sequence A104438 A125013 A005231

Adjacent sequences: A133811 A133812 A133813 this_sequence A133815 A133816 A133817

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Jan 06 2008

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research