A343504 a(n) is the least common multiple of the nonzero digits in factorial base expansion of n.

1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 6, 6, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 6, 6, 3, 3, 3, 3, 6, 6, 6, 6, 6

Offset

0,5

Comments

a(0) = 1 by convention.

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Index entries for sequences related to factorial base representation

Formula

a(n) = 1 iff n belongs to A059590.

Example

For n = 1000000:
- the factorial base expansion of 1000000 is "2, 6, 6, 2, 5, 1, 2, 2, 0",
- so a(1000000) = lcm(1, 2, 5, 6) = 30.

Prog

(PARI) a(n) = { my (v=1); for (r=2, oo, if (n==0, return (v), n%r, v=lcm(v, n%r)); n\=r) }

Crossrefs

Cf. A052429, A059590, A108731, A328582.

Sequence in context: A101615 A246359 A328114 * A328582 A227153 A328581

Adjacent sequences: A343501 A343502 A343503 * A343505 A343506 A343507

Keyword

nonn,look,base

Author

Rémy Sigrist, Apr 17 2021

Status

approved