login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A208575 Product of digits of n in factorial base. 11
0, 1, 0, 1, 0, 2, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 4, 0, 0, 0, 3, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 4, 0, 0, 0, 3, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 4, 0, 0, 0, 4, 0, 8, 0, 0, 0, 6, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 6, 0, 0, 0, 6, 0, 12, 0, 0, 0, 9, 0, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

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

M. R. Diamond and D. D. Reidpath, A counterexample to conjectures by Sloane and Erdos concerning the persistence of numbers, Journal of Recreational Mathematics 29:2 (1998), pp. 89-92.

Index entries for sequences related to factorial base representation

MATHEMATICA

(* For the definition of the factorial base version of IntegerDigits, see A007623 *) Table[Times@@factBaseIntDs[n], {n, 0, 99}] (* Alonso del Arte, Feb 28 2012 *)

PROG

(PARI) a(n)=my(k=1, s=1); while(n, s*=n%k++; n\=k); s

(Python)

from operator import mul

def A(n, p=2): return n if n<p else A(int(n/p), p+1)*10 + n%p

def a(n):

    x=str(A(n - 1))

    return 0 if x.count("0")!=0 else reduce(mul, [int(i) for i in x])

print [a(n) for n in range(1, 101)] # Indranil Ghosh, Jun 19 2017

CROSSREFS

Cf. A007623, A007954, A031346, A208576, A208277, A227153, A227154, A286590.

Sequence in context: A293959 A333146 A135767 * A070203 A070201 A070138

Adjacent sequences:  A208572 A208573 A208574 * A208576 A208577 A208578

KEYWORD

nonn,base

AUTHOR

Charles R Greathouse IV, Feb 28 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 13:01 EDT 2020. Contains 334748 sequences. (Running on oeis4.)