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

 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. 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

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.

Last modified May 14 11:06 EDT 2021. Contains 343882 sequences. (Running on oeis4.)