cp's OEIS Frontend

A338775 a(n+1) is the number of times a(n) is the least common multiple of one or more consecutive terms in this sequence so far with a(1) = 1.

%I A338775 #12 Nov 12 2020 01:16:47
%S A338775 1,1,3,3,7,1,4,2,1,5,2,3,8,1,6,3,9,2,4,8,5,3,10,5,4,9,3,11,1,7,4,10,7,
%T A338775 5,5,7,6,6,8,6,9,5,8,7,7,9,6,10,8,8,10,9,7,10,10,12,1,8,12,3,12,7,11,
%U A338775 3,13,1,9,9,12,8,13,3,14,1,10,14,3,15,3,16,1
%N A338775 a(n+1) is the number of times a(n) is the least common multiple of one or more consecutive terms in this sequence so far with a(1) = 1.
%C A338775 This sequence is a variant of A332518.
%C A338775 This sequence is unbounded.
%H A338775 Rémy Sigrist, <a href="/A338775/b338775.txt">Table of n, a(n) for n = 1..10000</a>
%H A338775 Rémy Sigrist, <a href="/A338775/a338775.png">Density plot of the first 10000000 terms</a>
%H A338775 Rémy Sigrist, <a href="/A338775/a338775.gp.txt">PARI program for A338775</a>
%e A338775 For n = 2:
%e A338775 - a(1) = lcm(a(1)),
%e A338775 - so a(2) = 1.
%e A338775 For n = 3:
%e A338775 - a(2) = lcm(a(1)) = lcm(a(2)) = lcm(a(1), a(2)),
%e A338775 - so a(3) = 3.
%e A338775 For n = 4:
%e A338775 - a(3) = lcm(a(3)) = lcm(a(2), a(3)) = lcm(a(1), a(2), a(3)),
%e A338775 - so a(4) = 3.
%o A338775 (PARI) See Links section.
%Y A338775 Cf. A332518.
%K A338775 nonn
%O A338775 1,3
%A A338775 _Rémy Sigrist_, Nov 08 2020