Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Sequence in context: A071503 A029271 A035459 this_sequence A139246 A131227 A050981

Adjacent sequences: A048229 A048230 A048231 this_sequence A048233 A048234 A048235

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research