Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

COMMENT

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

LINKS

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

CROSSREFS

Sequence in context: A017870 A017860 A017850 this_sequence A118577 A135681 A135680

Adjacent sequences: A137909 A137910 A137911 this_sequence A137913 A137914 A137915

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Febr 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research