Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026368
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026368 a(n) = greatest k such that s(k) = n, where s = A026366. +0
1
3, 6, 11, 14, 19, 22, 25, 28, 33, 36, 41, 44, 47, 50, 55, 58, 63, 66, 71, 74, 79, 82, 85, 88, 93, 96, 101, 104, 107, 110, 115, 118, 123, 126, 131, 134, 139, 142, 145, 148, 153, 156, 161, 164, 167, 170, 175, 178, 183, 186, 189, 192, 197 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A136981 A074737 A063275 this_sequence A047398 A047924 A122599

Adjacent sequences: A026365 A026366 A026367 this_sequence A026369 A026370 A026371

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 4 12:27 EST 2008. Contains 151280 sequences.


AT&T Labs Research