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.
%I A350006 #6 Dec 12 2021 20:29:33
%S A350006 1,11,41,47,91,1361,4261,481,46067,5027,31499,888893,126205,36191,
%T A350006 7676353,26794127,206527,2560375,7716073
%N A350006 a(n) is the smallest ludic number L(k) such that the n-th difference of (L(k), ..., L(k+n)) is zero, where L is A003309; a(n) = 0 if no such number exists.
%C A350006 Equivalently, a(n) is the smallest ludic number L(k) such that there is a polynomial f of degree at most n-1 such that f(j) = L(j) for k <= j <= k+n.
%C A350006 a(n) = A003309(k), where k is the smallest positive integer such that A350004(n,k) = 0.
%C A350006 a(21) > 10^8 (unless a(21) = 0).
%F A350006 Sum_{j=0..n} (-1)^j*binomial(n,j)*A003309(k+j) = 0, where A003309(k) = a(n).
%e A350006 The first six consecutive ludic numbers for which the fifth difference is 0 are (47, 53, 61, 67, 71, 77), so a(5) = 47. The successive differences are (6, 8, 6, 4, 6), (2, -2, -2, 2), (-4, 0, 4), (4, 4), and (0).
%Y A350006 First column of A350007.
%Y A350006 Cf. A003309, A349643, A350002, A350004.
%K A350006 nonn,more
%O A350006 2,2
%A A350006 _Pontus von Brömssen_, Dec 08 2021