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 A382749 #17 May 05 2025 19:41:30 %S A382749 1,2,3,4,1,1,1,1,1,2,1,2,1,2,3,2,1,3,1,4,3,2,1,4,1,2,1,4,1,1,1,1,3,2, %T A382749 1,1,1,2,3,1,1,1,1,4,1,2,1,1,1,2,3,4,1,2,1,1,3,2,1,2,1,2,1,2,1,1,1,4, %U A382749 3,2,1,2,1,2,3,4,1,1,1,2,3,2,1,2,1,2,3,1,1,3,1,4,3,2,1,3,1,2,1,4 %N A382749 Position in block for greedy partition of length 4. %C A382749 a(n) = height of n with respect to the greedy convolution of length 4. %C A382749 Position of n i block containing it for the greedy partition of length 4 of the positive integers. %C A382749 a(n) = the column (one-indexed) in which n occurs in the infinite matrix A382747. %H A382749 Jan Snellman, <a href="/A382749/b382749.txt">Table of n, a(n) for n = 1..5000</a> %H A382749 W. Narkiewicz, <a href="https://eudml.org/doc/209799">On a class of arithmetical convolutions</a>, Colloq. Math. 10, 1963, pp 81--94. %H A382749 Jan Snellman, <a href="https://arxiv.org/abs/2504.02795">Greedy Regular Convolutions</a>, arXiv:2504.02795 [math.NT], 2025. %Y A382749 a(n) = column index of the unique position in the infinite matrix A382747 in which n occurs. %Y A382749 a(n) = 1 iff n is "primitive" with respect to the greedy convolution of length 4 i.e. if n occurs in A382748. %K A382749 nonn %O A382749 1,2 %A A382749 _Jan Snellman_, Apr 24 2025