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!)
 A286604 a(n) = n mod sum of digits of n in factorial base. 4
 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 0, 2, 0, 3, 0, 1, 2, 5, 0, 1, 0, 0, 1, 1, 0, 1, 2, 1, 2, 0, 0, 1, 2, 4, 0, 5, 2, 3, 4, 3, 4, 5, 0, 1, 2, 3, 0, 3, 0, 3, 0, 2, 3, 5, 0, 1, 2, 3, 4, 2, 1, 1, 2, 6, 0, 7, 0, 1, 2, 0, 1, 5, 2, 4, 0, 3, 4, 6, 4, 1, 2, 3, 4, 1, 0, 0, 1, 5, 6, 5, 0, 2, 3, 3, 4, 3, 2, 1, 2, 0, 1, 3, 0, 4, 5, 7, 0, 5, 2, 3, 4, 0, 1, 9, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10080 FORMULA a(n) = n mod A034968(n). PROG (Scheme) (define (A286604 n) (modulo n (A034968 n))) (Python) def a007623(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 February 20 07:54 EST 2020. Contains 332069 sequences. (Running on oeis4.)