Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081751
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081751 a(n) is the smallest number that is precisely n-tuply abundant. +0
1
12, 24, 78, 66, 54, 42, 30, 120, 540, 390, 264, 282, 366, 180, 546, 510, 330, 318, 990, 936, 702, 780, 564, 1290, 870, 528, 312, 168, 222, 150, 138, 5778, 6174, 3432, 3150, 2850, 2190, 8432, 4464, 3472, 2480, 1488, 5430, 6750, 4452, 4396, 4650, 3270, 2712 (list; graph; listen)
OFFSET

1,1

COMMENT

a(24) <= 1290

See A081705 for the definition of n-tuply abundant. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 24 2004

FORMULA

a(n) = smallest number that is precisely n-tuply abundant

EXAMPLE

a(3)=78 because 78 is the smallest number that is exactly triply abundant.

PROGRAM

(PARI) program by D. Wasserman LIMIT = 50; A = vector(LIMIT); count = 0; i = 1; while (count < LIMIT, i = i + 1: ab = 0: lastn = i: n = sigma(i) - i: while(ab <= LIMIT && n > lastn, ab = ab + 1: lastn = n: n = sigma(lastn) - n): if(ab <= LIMIT && ab > 0 && A[ab] == 0, A[ab] = i: count = count + 1))

CROSSREFS

Cf. A081705, A081699.

Sequence in context: A001335 A145899 A001041 this_sequence A120360 A120356 A109745

Adjacent sequences: A081748 A081749 A081750 this_sequence A081752 A081753 A081754

KEYWORD

nonn

AUTHOR

Gabriel Cunningham (gcasey(AT)mit.edu), Apr 08 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 24 2004

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