Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Sequence in context: A100405 A081366 A129636 this_sequence A087188 A102885 A138585

Adjacent sequences: A048216 A048217 A048218 this_sequence A048220 A048221 A048222

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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research