|
|
A372258
|
|
An infinite sequence over {0,1} with no palindromes of length > 12.
|
|
2
|
|
|
0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
A palindrome is a block that reads the same forwards and backwards.
|
|
LINKS
|
|
|
FORMULA
|
Generated by iterating the morphism 0->01, 1->21, 2->34, 3->01, 4->54, 5->34, followed by the coding n->n mod 2.
a(n) = (n + A014707(floor(n/2))) mod 2 [per Berstel et al section 4, but misprint there "word y" should be "word z"]. (End)
|
|
PROG
|
(PARI) a(n) = bitxor(bitand(n, 1), bittest(n, valuation(n>>1+1, 2)+2)); \\ Kevin Ryde, Apr 28 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|