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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260394 Infinite palindromic word (a(1),a(2),a(3),...) with initial word w(1) = (0,1,1) and midword sequence (a(n)); see Comments. 5
0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1

COMMENTS

Below, w* denotes the reversal of a word w, and "sequence" and "word" are interchangable. An infinite word is palindromic if it has infinitely many initial subwords w such that w = w*.

Many infinite palindromic words (a(1),a(2),...) are determined by an initial word w and a midword sequence (m(1),m(2),...) of palindromes, as follows: for given w of length k, take w(1) = w = (a(1),a(2),...,a(k)). Form the palindrome w(2) = w(1)m(1)w(1)* by concatenating w(1), m(1), and w(1)*. Continue inductively; i.e., w(n+1) = w(n)m(n)w(n)* for all n >= 1. See A260390 for examples.

LINKS

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

FORMULA

a(n) = 1 - A260444(n).

EXAMPLE

w(1) = 011, the initial word.

w(2) = 0110110 ( = 011+0+110, where + = concatenation)

w(3) = w(2)+1+w(2)*

w(4) = w(3)+1+w(3)*

MATHEMATICA

u[1] = {0, 1, 1}; m[1] = {u[1][[1]]};

u[n_] := u[n] = Join[u[n - 1], m[n - 1], Reverse[u[n - 1]]];

m[k_] := {u[k][[k]]}; u[6]

CROSSREFS

Cf. A260390, A260397, A260444.

Sequence in context: A225183 A082410 A189479 * A181932 A284792 A094217

Adjacent sequences:  A260391 A260392 A260393 * A260395 A260396 A260397

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 31 2015

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 November 18 04:44 EST 2019. Contains 329248 sequences. (Running on oeis4.)