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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284902 Positions of 0 in A284901; complement of A284903. 3
1, 4, 5, 6, 8, 9, 10, 11, 13, 15, 18, 19, 20, 21, 23, 25, 27, 30, 31, 32, 33, 36, 37, 38, 39, 42, 43, 44, 46, 47, 48, 49, 51, 53, 55, 58, 59, 60, 61, 64, 65, 66, 67, 70, 71, 72, 73, 76, 77, 78, 80, 81, 82, 83, 85, 87, 89, 92, 93, 94, 96, 97, 98, 99, 101, 103 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Conjecture: -3 < n*r - a(n) < 3 for n >= 1, where r = (3+sqrt(3))/3.

LINKS

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

EXAMPLE

As a word, A284901 = 01100010..., in which 0 is in positions 1,4,5,6,8,9,11,...

MATHEMATICA

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

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

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

CROSSREFS

Cf. A284901, A284903.

Sequence in context: A088720 A134848 A061578 * A023851 A285279 A091242

Adjacent sequences:  A284899 A284900 A284901 * A284903 A284904 A284905

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 16 2017

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 7 05:14 EST 2019. Contains 329839 sequences. (Running on oeis4.)