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 A332518 #20 Jun 04 2025 12:35:49 %S A332518 1,1,3,3,4,1,4,4,5,1,5,4,6,1,6,4,7,1,7,4,8,1,8,4,9,4,10,1,9,6,5,5,6,6, %T A332518 7,5,7,6,8,5,8,6,9,7,7,8,7,9,8,8,9,9,10,3,5,9,11,1,10,5,10,6,10,7,10, %U A332518 8,10,9,12,3,6,11,3,7,11,4,11,5,11,6,12,4 %N A332518 a(n+1) is the number of times a(n) is the product of one or more consecutive terms in this sequence so far with a(1) = 1. %C A332518 This sequence is a multiplicative variant of A331614. %C A332518 This sequence is unbounded. %H A332518 Rémy Sigrist, <a href="/A332518/b332518.txt">Table of n, a(n) for n = 1..10000</a> %H A332518 Rémy Sigrist, <a href="/A332518/a332518.txt">C program for A332518</a> %e A332518 The first terms, alongside the corresponding products, are: %e A332518 n a(n) Products %e A332518 -- ---- -------- %e A332518 1 1 a(1) %e A332518 2 1 a(1), a(1)*a(2), a(2) %e A332518 3 3 a(1)*a(2)*a(3), a(2)*a(3), a(3) %e A332518 4 3 a(1)*a(2)*a(3), a(2)*a(3), a(3), a(4) %e A332518 5 4 a(5) %e A332518 6 1 a(1), a(1)*a(2), a(2), a(6) %e A332518 7 4 a(5), a(5)*a(6), a(6)*a(7), a(7) %e A332518 8 4 a(5), a(5)*a(6), a(6)*a(7), a(7), a(8) %e A332518 9 5 a(9) %e A332518 10 1 a(1), a(1)*a(2), a(2), a(6), a(10) %e A332518 11 5 a(9), a(9)*a(10), a(10)*a(11), a(11) %e A332518 12 4 a(5), a(5)*a(6), a(6)*a(7), a(7), a(8), a(12) %o A332518 (C) // See Links section. %Y A332518 Cf. A331614. %K A332518 nonn %O A332518 1,3 %A A332518 _Rémy Sigrist_, Feb 15 2020