login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026364 a(n) = greatest k such that s(k) = n, where s = A026362. 5
2, 7, 10, 13, 16, 21, 24, 29, 32, 37, 40, 45, 48, 51, 54, 59, 62, 67, 70, 73, 76, 81, 84, 89, 92, 95, 98, 103, 106, 111, 114, 117, 120, 125, 128, 133, 136, 141, 144, 149, 152, 155, 158, 163, 166, 171, 174, 177, 180, 185, 188, 193, 196 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Complement of A026363.  Positions of 0 in the fixed point of the morphism 0->11, 1->101; see A285430.  Conjecture:  -1 < n*r - a(n) < 4 for n>=1, where r = 2 + sqrt(3). - Clark Kimberling, Apr 28 2017

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

MATHEMATICA

s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {1, 0, 1}}] &, {0}, 13] (* A285430 *)

Flatten[Position[s, 0]]  (* A026364 *)

Flatten[Position[s, 1]]  (* A026363 *)

(* Clark Kimberling, Apr 28 2017 *)

CROSSREFS

Cf. A026363, A285430.

Sequence in context: A190433 A277551 A029904 * A203621 A297832 A003158

Adjacent sequences:  A026361 A026362 A026363 * A026365 A026366 A026367

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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 05:20 EST 2021. Contains 349426 sequences. (Running on oeis4.)