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 A370974 #11 Apr 15 2024 16:12:59 %S A370974 1,2,6,20,24,120,140,858,924,1008,1120,1430,10080,11088,12012,22880, %T A370974 176358,388960,1662804,1750320,3879876,4056234,9694845,10029150, %U A370974 10400600,10816624,33256080,270415600,280816200,290845350,300540195,1037158320,1452021648,3181073742,3267048708,9617286240,13784652882,20583576819,35263382880,120880802196 %N A370974 A260850 sorted into increasing order and duplicates omitted. %C A370974 It seems very likely that there are no duplicates in A260850. Compare the proof of the analogous property of A008336. %H A370974 Michael De Vlieger, <a href="/A370974/b370974.txt">Table of n, a(n) for n = 1..3365</a> %H A370974 Michael De Vlieger, <a href="/A370974/a370974.png">Plot p(i)^m(i) | a(n) at (x,y) = (n,i)</a>, n = 1..2048, with a color function where black indicates m(i) = 1, red indicates m(i) = 2, ..., magenta indicates the largest m(i) for n <= 2048. %Y A370974 Cf. A008336, A065422, A260850, A370968. %K A370974 nonn %O A370974 1,2 %A A370974 _N. J. A. Sloane_, Apr 15 2024