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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026254 a(n) = j if n = [ j*sqrt(3) ], else a(n) = k if n = [ (k/2)*(3 + sqrt(3)) ]. 0
1, 1, 2, 2, 3, 4, 3, 5, 4, 6, 5, 7, 8, 6, 9, 7, 10, 8, 11, 12, 9, 13, 10, 14, 15, 11, 16, 12, 17, 13, 18, 19, 14, 20, 15, 21, 16, 22, 23, 17, 24, 18, 25, 19, 26, 27, 20, 28, 21, 29, 30, 22, 31, 23, 32, 24, 33, 34, 25, 35, 26, 36, 27, 37, 38, 28 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Every positive integer occurs exactly twice.  a(n) is the parent of n in the tree A178528 generated by the Beatty sequence of sqrt(3).

CROSSREFS

Cf. A178528, A022838, A054406.

Sequence in context: A080046 A047675 A187199 * A091525 A091524 A026350

Adjacent sequences:  A026251 A026252 A026253 * A026255 A026256 A026257

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Comment by Clark Kimberling (ck6(AT)evansville.edu), Dec 24 2010

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 February 15 09:00 EST 2012. Contains 205746 sequences.