Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048207
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048207 a(n)=least m such that column m of T that contains n, array T given by A048201. +0
1
1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 3, 4, 2, 1, 1, 1, 3, 2, 4, 5, 1, 1, 3, 2, 1, 1, 4, 1, 5, 6, 2, 3, 1, 1, 1, 1, 4, 1, 3, 1, 5, 1, 6, 7, 3, 1, 4, 1, 1, 1, 2, 5, 1, 2, 4, 6, 1, 7, 8, 1, 2, 1, 5, 1, 1, 4, 2, 6, 2, 1, 2, 7, 3, 8, 9, 5, 1, 2, 3, 1, 1, 2, 1, 6, 1, 1, 3, 5, 7, 1 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Adjacent sequences: A048204 A048205 A048206 this_sequence A048208 A048209 A048210

Sequence in context: A133255 A141289 A140191 this_sequence A105810 A063726 A112757

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research