Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137911
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137911 Smallest of at least two consecutive numbers whose product is A045619(n). +0
3
0, 1, 1, 3, 4, 1, 5, 6, 7, 3, 8, 9, 10, 1, 11, 12, 13, 5, 15, 16, 17, 6, 18, 3, 19, 20, 21, 7, 22, 23, 24, 25, 26, 1, 27, 28, 4, 29, 30, 9, 31, 32, 33, 34, 35, 10, 36, 37, 38, 39, 40, 5, 11, 41, 42, 43, 44, 45, 46, 12, 47, 48, 49, 3, 50, 51, 13, 52, 53, 54, 6, 55, 56, 57, 14, 58, 59, 60 (list; graph; listen)
OFFSET

1,4

COMMENT

A045619(n)=A000142(a(n))/A000142(A137912(n)-1) for n>1.

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..5000

EXAMPLE

a(24) = 3, A137912(24) = 6: A045619 = 3*4*5*6 = 360.

CROSSREFS

Sequence in context: A091542 A079529 A133779 this_sequence A019599 A114156 A143771

Adjacent sequences: A137908 A137909 A137910 this_sequence A137912 A137913 A137914

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 27 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research