The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268866 Records in A268865. 3
 2, 3, 22, 38, 342, 598, 5462, 9558, 87382, 152918, 1398102, 2446678, 22369622, 39146838 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Conjecture 1: Let m(n) be the position in A268865 corresponding to a(n). Then m(n) = (2/3)*(4^n-1), if n is even, and m(n) = (2/3)*(4^(n-1)-1) + 3*4^(n-1), if n is odd. Conjecture 2: a(n) = 2*m(n) + 2, if n is even, and a(n) = (7*m+12)/11, if n is odd. If Conjectures 1 and 2 are true, then we easily have for even n >= 0, m(n) == 0 (mod 10), a(n) == 2 (mod 10), while a(1) = m(1) = 3 and for odd n >= 3, m(n), a(n) == 8 (mod 10). The sequence {m(n)} begins: 0, 3, 10, 58, 170, 938, 2730, 15018, 43690, ... LINKS Table of n, a(n) for n=0..13. Jeffrey Shallit, Sonja Linghui Shan, and Kai Hsiang Yang, Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev, arXiv:2208.06025 [cs.FL], 2022. Vladimir Shevelev, Two analogs of Thue-Morse sequence, arXiv:1603.04434 [math.NT], 2016. MATHEMATICA nn = 10^5; f[n_, b_] := Most@ Mod[NestWhileList[-(#1 - Mod[#1, b])/b &, n, #1 != 0 &], b]; Union@ FoldList[Max, Array[(k = 0; While[Mod[Total@ f[k, 2], 2] == ThueMorse[# + k], k++]; k) &, nn - 1, 0]] (* Michael De Vlieger, Aug 25 2022 *) CROSSREFS Cf. A268865. Sequence in context: A062921 A298470 A083178 * A154254 A264696 A166122 Adjacent sequences: A268863 A268864 A268865 * A268867 A268868 A268869 KEYWORD nonn,more AUTHOR Vladimir Shevelev and Peter J. C. Moses, Feb 15 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 13 05:19 EDT 2024. Contains 371639 sequences. (Running on oeis4.)