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 A329440 #13 Nov 14 2019 13:19:18 %S A329440 0,2,1,5,3,1,5,4,3,2,17,13,9,5,1,6,5,4,3,2,1,37,31,25,19,13,7,1,10,9, %T A329440 8,7,6,5,4,3,18,16,14,12,10,8,6,4,2,18,17,14,13,10,9,6,5,2,1,101,91, %U A329440 81,71,61,51,41,31,21,11,1,13,12,11,10,9,8,7,6,5,4 %N A329440 Triangle read by rows: n-th row gives positions of ones in A329126(n) in decreasing order. %C A329440 Does the n-th row always contain n entries? %C A329440 Do the rows always form an n term arithmetic progression? %C A329440 Conjecture: the last value in each row is A051903(n). %e A329440 Table begins: %e A329440 0 %e A329440 2, 1 %e A329440 5, 3, 1 %e A329440 5, 4, 3, 2 %e A329440 17, 13, 9, 5, 1 %e A329440 6, 5, 4, 3, 2, 1 %e A329440 37, 31, 25, 19, 13, 7, 1 %e A329440 For example, when n = 5, x^17 + x^13 + x^9 + x^5 + x is a multiple of 5 for all integers x > 1. %Y A329440 Cf. A051903, A329126. %K A329440 nonn,tabl %O A329440 1,2 %A A329440 _Peter Kagey_, Nov 13 2019