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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026491 a(n) = least k > a(n-1) such that t(k) = t(n), for n >= 1, where t = A001285 (Thue-Morse sequence). 2
1, 4, 5, 8, 10, 12, 13, 16, 17, 20, 21, 24, 26, 28, 29, 32, 34, 36, 37, 40, 42, 44, 45, 48, 49, 52, 53, 56, 58, 60, 61, 64, 65, 68, 69, 72, 74, 76, 77, 80, 81, 84, 85, 88, 90, 92, 93, 96, 98, 100, 101, 104, 106, 108, 109, 112, 113, 116, 117 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The sequence (a(n+1)-a(n)) of first differences equals A171900(n+2) for n=1,2,... . - Michel Dekking, Apr 11 2019

LINKS

Robert Israel, Table of n, a(n) for n = 0..10000

MAPLE

N:= 200: # for terms <= N

S:= StringTools:-ThueMorse(N):

R:= 1: r:= 1:

for n from 1 do

  j:= SearchText(S[n], S, r+1..-1);

  if j = 0 then break fi;

  R:= R, r+j;

  r:= r+j;

  if r >= N then break fi;

od:

R; # Robert Israel, Apr 11 2019

CROSSREFS

Cf. A001285, A171900.

Sequence in context: A092022 A190200 A162902 * A255491 A292658 A304108

Adjacent sequences:  A026488 A026489 A026490 * A026492 A026493 A026494

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 June 23 10:57 EDT 2021. Contains 345397 sequences. (Running on oeis4.)