login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286606 a(n) = n mod product of nonzero digits of n in factorial base. 2
0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 4, 5, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 4, 5, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 0, 1, 2, 3, 10, 11, 0, 1, 2, 0, 4, 5, 0, 1, 2, 0, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 6, 7, 8, 9, 22, 23, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,20

LINKS

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

Index entries for sequences related to factorial base representation

FORMULA

a(n) = n mod A227153(n).

PROG

(Scheme) (define (A286606 n) (modulo n (A227153 n)))

(Python)

from operator import mul

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

def a(n):

    x=str(a007623(n)).replace('0', '')

    return n%reduce(mul, map(int, list(x)))

print [a(n) for n in xrange(1, 201)] # Indranil Ghosh, Jun 21 2017

CROSSREFS

Cf. A227153, A286604.

Sequence in context: A296805 A084247 A300307 * A266587 A070692 A162397

Adjacent sequences:  A286603 A286604 A286605 * A286607 A286608 A286609

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, Jun 18 2017

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 12:01 EDT 2018. Contains 316279 sequences. (Running on oeis4.)