|
|
|
|
0, 1, 2, 1, 4, 1, 6, 1, 2, 1, 4, 1, 12, 1, 2, 1, 4, 1, 18, 1, 2, 1, 4, 1, 24, 1, 2, 1, 4, 1, 30, 1, 2, 1, 4, 1, 6, 1, 2, 1, 4, 1, 12, 1, 2, 1, 4, 1, 18, 1, 2, 1, 4, 1, 24, 1, 2, 1, 4, 1, 60, 1, 2, 1, 4, 1, 6, 1, 2, 1, 4, 1, 12, 1, 2, 1, 4, 1, 18, 1, 2, 1, 4, 1, 24, 1, 2, 1, 4, 1, 90, 1, 2, 1, 4, 1, 6, 1, 2, 1, 4, 1, 12, 1, 2, 1, 4, 1, 18, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
Other identities. For all n >= 0:
|
|
MATHEMATICA
|
{0}~Join~Table[k = 1; While[! CoprimeQ[Prime@ k, n], k++]; Mod[n, Product[Prime@ i, {i, k}]], {n, 79}] (* Michael De Vlieger, Jun 22 2017 *)
|
|
PROG
|
(Scheme, two versions)
(define (A276094 n) (if (zero? n) n (let loop ((n n) (i 1) (pr 1)) (let* ((p (A000040 i)) (d (modulo n p))) (if (not (zero? d)) (* d pr) (loop (/ (- n d) p) (+ 1 i) (* pr p)))))))
(Python)
from sympy import nextprime, primepi, primorial
def a053669(n):
p = 2
while True:
if n%p: return p
else: p=nextprime(p)
def a257993(n): return primepi(a053669(n))
def a002110(n): return 1 if n<1 else primorial(n)
def a(n): return 0 if n==0 else n%a002110(a257993(n))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|