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.

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, 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, 8, 10, 9, 12, 3, 6, 11, 3, 7, 11, 4, 11, 5, 11, 6, 12, 4

Offset: 1

Author

Rémy Sigrist, Feb 15 2020

Keywords

• nonn

Comments

This sequence is a multiplicative variant of A331614.

This sequence is unbounded.

Examples

			The first terms, alongside the corresponding products, are:
  n   a(n)  Products
  --  ----  --------
   1     1  a(1)
   2     1  a(1),           a(1)*a(2),  a(2)
   3     3  a(1)*a(2)*a(3), a(2)*a(3),  a(3)
   4     3  a(1)*a(2)*a(3), a(2)*a(3),  a(3),        a(4)
   5     4  a(5)
   6     1  a(1),           a(1)*a(2),  a(2),        a(6)
   7     4  a(5),           a(5)*a(6),  a(6)*a(7),   a(7)
   8     4  a(5),           a(5)*a(6),  a(6)*a(7),   a(7), a(8)
   9     5  a(9)
  10     1  a(1),           a(1)*a(2),  a(2),        a(6), a(10)
  11     5  a(9),           a(9)*a(10), a(10)*a(11), a(11)
  12     4  a(5),           a(5)*a(6),  a(6)*a(7),   a(7), a(8), a(12)
		

Links

• Rémy Sigrist, Table of n, a(n) for n = 1..10000
• Rémy Sigrist, C program for A332518

Crossrefs

Cf. A331614.

Programs

C

// See Links section.