Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061769
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061769 The least number k = a(n) > a(n-1) for which k!/(k+1)^m for increasing m's. +0
2
1, 5, 11, 23, 35, 39, 44, 47, 59, 71, 79, 89, 119, 143, 179, 239, 359, 479, 629, 671, 719, 1079, 1119, 1259, 1343, 1439, 1889, 2015, 2159, 2239, 2519, 2879, 3023, 3359, 3779, 4031, 4319, 5039, 6047, 6719, 7559, 8639, 10079 (list; graph; listen)
OFFSET

0,2

EXAMPLE

a(5) = 35 (one of the few composites in this sequence) because 35 is the least number such that 35!/36^7 and 23!/24^6.

MATHEMATICA

l = 0; Do[k = Max[l - 1, 1]; While[ !IntegerQ[ k! / (k + 1)^n], k++ ]; If[ k > l, l = k; Print[k] ], {n, 0, 1500} ]

CROSSREFS

Sequence in context: A161896 A167610 A143127 this_sequence A143125 A147081 A046628

Adjacent sequences: A061766 A061767 A061768 this_sequence A061770 A061771 A061772

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 21 2001

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