Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054089
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054089 For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(2k)=q(k), a(2k+1)=p(k). +0
1
1, 3, 2, 6, 4, 8, 5, 11, 7, 14, 9, 16, 10, 19, 12, 21, 13, 24, 15, 27, 17, 29, 18, 32, 20, 35, 22, 37, 23, 40, 25, 42, 26, 45, 28, 48, 30, 50, 31, 53, 33, 55, 34, 58, 36, 61, 38, 63, 39, 66, 41, 69, 43, 71, 44, 74, 46, 76, 47, 79, 49, 82, 51 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Odd-indexed terms, Cf. A026351(n)=[n*tau]+1.

Even-indexed terms, Cf. A004957(n)=[n*tau]+n+1.

Sequence in context: A120911 A064789 A093050 this_sequence A006368 A105354 A094077

Adjacent sequences: A054086 A054087 A054088 this_sequence A054090 A054091 A054092

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research