Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048206
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048206 a(n)=least m such that row m of T contains n, array T given by A048201. +0
1
1, 2, 2, 3, 4, 3, 3, 5, 4, 6, 4, 4, 5, 7, 8, 9, 5, 6, 5, 5, 10, 11, 6, 7, 12, 13, 6, 14, 6, 6, 9, 7, 15, 16, 17, 18, 7, 19, 8, 20, 7, 21, 7, 7, 9, 22, 8, 23, 24, 25, 13, 8, 26, 14, 9, 8, 27, 8, 8, 28, 15, 29, 9, 30, 31, 10, 16, 9, 17, 32, 18, 9, 13, 9, 9 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A117114 A126688 A054703 this_sequence A075765 A014656 A003078

Adjacent sequences: A048203 A048204 A048205 this_sequence A048207 A048208 A048209

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research