A257080 n multiplied by the least nonzero digit missing from its factorial base representation: a(n) = n * A257079(n).

0, 2, 4, 6, 4, 15, 12, 14, 16, 18, 30, 33, 12, 39, 42, 45, 16, 51, 18, 38, 40, 42, 22, 92, 48, 50, 52, 54, 84, 87, 60, 62, 64, 66, 102, 105, 108, 111, 114, 117, 120, 123, 84, 86, 88, 90, 184, 188, 48, 147, 150, 153, 52, 159, 162, 165, 168, 171, 174, 177, 60, 183, 186, 189, 64, 195, 66, 268, 272, 276, 70, 284, 72

Offset

0,2

Links

Antti Karttunen, Table of n, a(n) for n = 0..10080

Eric Angelini, et al, "Multiply by the fantom digit", Discussion on Seqfan-list

Formula

a(n) = n * A257079(n).

Prog

(Scheme) (define (A257080 n) (* n (A257079 n)))

Crossrefs

A255411 gives the fixed points, positions where a(n) = n.

Cf. A257079, A257081 (number of iterations needed before a fixed point is reached).

Sequence in context: A278259 A293473 A353512 * A099784 A365160 A082747

Adjacent sequences: A257077 A257078 A257079 * A257081 A257082 A257083

Keyword

nonn,base,look

Author

Antti Karttunen, Apr 15 2015

Status

approved