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 A341285 #42 Feb 19 2021 18:36:01
%S A341285 1,2,2,3,2,4,3,2,3,4,3,4,2,4,5,4,3,3,5,6,2,6,4,4,4,4,5,5,3,5,3,5,5,2,
%T A341285 6,6,4,4,6,6,6,4,7,4,5,7,3,7,4,5,5,6,5,8,2,6,3,6,7,4,5,6,5,5,5,6,7,4,
%U A341285 6,4,6,6,5,8,6,3,4,6,6,6,4,8,5,7,7,6,7
%N A341285 Let B be the set of sequences of positive integers {b(k), k >= 0} such that for some k > 0 (necessarily unique) and any m >= 0, b(m+k) = b(m) + b(m+1) + ... + b(m+k-1); let g(b) = b(0); a(n) is the least value of g(b) for an element b of B containing n.
%C A341285 This sequence is a generalization of A249783 and A341456 to the set of "k-bonacci sequences of positive integers".
%H A341285 Rémy Sigrist, <a href="/A341285/b341285.txt">Table of n, a(n) for n = 1..10000</a>
%H A341285 Rémy Sigrist, <a href="/A341285/a341285.txt">C program for A341285</a>
%F A341285 a(n) <= n.
%F A341285 a(m*n) <= m*a(n).
%F A341285 a(n) = 2 iff n belongs to A020695.
%F A341285 a(n) = A070939(A341699(n)).
%e A341285 The first terms of the elements b of B such that g(b) <= 3 are:
%e A341285 g(b) b(0) b(1) b(2) b(3) b(4) b(5) b(6) b(7) b(8) b(9)
%e A341285 ---- ---- ---- ---- ---- ---- ---- ---- ---- ---- ----
%e A341285 1 1 1 1 1 1 1 1 1 1 1
%e A341285 2 2 2 2 2 2 2 2 2 2 2
%e A341285 2 1 1 2 3 5 8 13 21 34 55
%e A341285 3 3 3 3 3 3 3 3 3 3 3
%e A341285 3 1 2 3 5 8 13 21 34 55 89
%e A341285 3 2 1 3 4 7 11 18 29 47 76
%e A341285 3 1 1 1 3 5 9 17 31 57 105
%e A341285 - so a(1) = 1,
%e A341285 a(2) = a(3) = a(5) = a(8) = 2,
%e A341285 a(4) = a(7) = a(9) = a(11) = a(17) = a(18) = 3.
%o A341285 (C) See Links section.
%Y A341285 Cf. A020695, A070939, A249783, A341456, A341699.
%K A341285 nonn
%O A341285 1,2
%A A341285 _Rémy Sigrist_, Feb 16 2021