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.

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, 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, 3, 13, 1, 9, 9, 12, 8, 13, 3, 14, 1, 10, 14, 3, 15, 3, 16, 1

Offset: 1

Author

Rémy Sigrist, Nov 08 2020

Keywords

• nonn

Comments

This sequence is a variant of A332518.

This sequence is unbounded.

Examples

			For n = 2:
- a(1) = lcm(a(1)),
- so a(2) = 1.
For n = 3:
- a(2) = lcm(a(1)) = lcm(a(2)) = lcm(a(1), a(2)),
- so a(3) = 3.
For n = 4:
- a(3) = lcm(a(3)) = lcm(a(2), a(3)) = lcm(a(1), a(2), a(3)),
- so a(4) = 3.
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000
• Rémy Sigrist, Density plot of the first 10000000 terms
• Rémy Sigrist, PARI program for A338775

Crossrefs

Cf. A332518.

Programs

PARI

See Links section.