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!)
 A227153 Product of nonzero digits of n in factorial base. 11
 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 4, 4, 3, 3, 3, 3, 6, 6, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 4, 4, 3, 3, 3, 3, 6, 6, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 8, 8, 6, 6, 6, 6, 12, 12, 3, 3, 3, 3, 6, 6, 3, 3, 3, 3, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS a(0) = 1 as an empty product always gives 1. LINKS Antti Karttunen, Table of n, a(n) for n = 0..5040 FORMULA For all n, a(A227157(n)) = A208575(A227157(n)). PROG (GNU/MIT Scheme): (define (A227153 n) (apply * (delete-matching-items (n->factbase n) zero?))) (define (n->factbase n) (let loop ((n n) (fex (if (zero? n) (list 0) (list))) (i 2)) (cond ((zero? n) fex) (else (loop (floor->exact (/ n i)) (cons (modulo n i) fex) (1+ i)))))) (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 16 10:58 EDT 2021. Contains 343941 sequences. (Running on oeis4.)