Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154882
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154882 a(n) = smallest number with at least as many divisors as (a(n-1))^2 +0
1
2, 4, 12, 120, 7560, 8648640, 1927522396800, 4747472432036420486400, 128438082648984172330026178330296384000, 6184173455628205993842062057864303743050691444602955105860128640000 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=A061799(A048691(a(n-1))). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 21 2009]

EXAMPLE

4^2 = 16 with 5 divisors; smallest number with at least 5 divisors is 12

CROSSREFS

Sequence in context: A038791 A001696 A013333 this_sequence A062000 A053040 A154734

Adjacent sequences: A154879 A154880 A154881 this_sequence A154883 A154884 A154885

KEYWORD

nonn

AUTHOR

J. Lowell (jhbubby(AT)mindspring.com), Jan 16 2009

EXTENSIONS

a(6)-a(10) from Donovan Johnson (donovan.johnson(AT)yahoo.com), May 09 2009

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