cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A340397 Complete sequence of numeric generators of delayed palindromes used to get 289-step delayed palindromes.

This page as a plain text file.
%I A340397 #36 Jan 21 2021 12:03:13
%S A340397 105956506309091459564960,53528258705040674282425,
%T A340397 31769674352025337585712,53528258709000674282425,
%U A340397 53528298705040670282425,53528298709000670282425,53928258705040674282025,53928258709000674282025,53928298705040670282025,31564654352025334636412
%N A340397 Complete sequence of numeric generators of delayed palindromes used to get 289-step delayed palindromes.
%C A340397 The terms of this sequence are based on the terms of A326414 and are used to extend 288-step delayed palindromes up to 289-step delayed palindromes with the help of brute force extension of the method of undetermined coefficients.
%H A340397 Anton Stefanov, <a href="/A340397/b340397.txt">Table of n, a(n) for n = 1..20</a>
%H A340397 Jason Doucette and Anton Stefanov, <a href="http://jasondoucette.com/pal/13968441660506503386020">Final 289 steps World Record proof with some numeric generators of delayed palindromes inside</a>
%H A340397 Anton Stefanov, <a href="https://habr.com/ru/post/536104/">Extending the method of undetermined coefficients</a>
%H A340397 Anton Stefanov, <a href="/A340397/a340397.txt">isExtends test realisation on C# (to verify A340397 elements)</a>
%e A340397 The 285-step delayed palindrome 105956506309091459564960 can be extended to the 286-step delayed palindrome 53528258705040674282425, which in turn can be extended to the 287-step delayed palindrome 31769674352025337585712. This 287-step solution is unextendable so we start a new branch from the 286-step solution 53528258709000674282425 which also extends the first term of our sequence, and so on.
%o A340397 (C#) See Anton Stefanov link.
%Y A340397 A326414 contains two numeric generators of delayed palindromes from our sequence: 16232852231012114813251 and 16232892231012110813251.
%Y A340397 A072216 contains delayed palindromes of n digits with the greatest number of steps to converge.
%Y A340397 A065199 contains records for the number of 'Reverse and Add' steps needed to reach a palindrome.
%Y A340397 A065198 contains the most delayed palindromes in the order of their discovery and gives the starting points for the corresponding elements of the sequence A065199.
%K A340397 nonn,base,fini
%O A340397 1,1
%A A340397 _Anton Stefanov_, Jan 06 2021