OFFSET
1,1
COMMENTS
Begin with the left (most significant) k digits and sequentially remove the first j leading digits until a palindrome is found; continue.
a(23) is actually 040 (which should be obvious), a(24) is 00, a(30) is 00, a(44) is 00, a(56) is 00, etc.
If the Blazys's constant is a normal number then all palindromes should eventually appear.
LINKS
EXAMPLE
Blazys's constant is 2.566543832171388844467529106332285751782972828702314645...
MATHEMATICA
bc = RealDigits[ Fold[(#2 + #2/#1) &, 1, Reverse@ Prime@ Range@ 1000], 10, 1000][[1]]; palQ[n_] := n == Reverse[n]; k = 1; lst = {}; While[j = k + 1; k < 600, While[j < 600 - k, If[ palQ[ Take[ bc, {k, j}]], p = FromDigits[ Take[ bc, {k, j}]]; AppendTo[lst, p]; Print[p]]; j++]; k++]; lst
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert G. Wilson v, May 27 2014
STATUS
approved