login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..63.

CROSSREFS

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

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

Sequence in context: A191733 A191444 A093050 * A006368 A202845 A202838

Adjacent sequences:  A054086 A054087 A054088 * A054090 A054091 A054092

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 22 00:16 EDT 2013. Contains 225508 sequences.