A285323 a(n) = A065642(A065642(A019565(n))) / A019565(n).
1, 4, 9, 3, 25, 4, 5, 3, 49, 4, 7, 3, 7, 4, 5, 3, 121, 4, 9, 3, 11, 4, 5, 3, 11, 4, 7, 3, 7, 4, 5, 3, 169, 4, 9, 3, 13, 4, 5, 3, 13, 4, 7, 3, 7, 4, 5, 3, 13, 4, 9, 3, 11, 4, 5, 3, 11, 4, 7, 3, 7, 4, 5, 3, 289, 4, 9, 3, 17, 4, 5, 3, 17, 4, 7, 3, 7, 4, 5, 3, 17, 4, 9, 3, 11, 4, 5, 3, 11, 4, 7, 3, 7, 4, 5, 3, 17, 4, 9, 3, 13, 4, 5, 3, 13, 4, 7, 3, 7, 4, 5, 3
Offset: 0
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 0..10000
Crossrefs
Programs
-
PARI
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler A007947(n) = factorback(factorint(n)[, 1]); \\ From Andrew Lelechenko, May 09 2014 A065642(n) = { my(r=A007947(n)); if(1==n,n,n = n+r; while(A007947(n) <> r, n = n+r); n); }; A285323(n) = A065642(A065642(A019565(n))) / A019565(n);
-
Python
from operator import mul from sympy import prime, primefactors from functools import reduce def a019565(n): return reduce(mul, (prime(i+1) for i, v in enumerate(bin(n)[:1:-1]) if v == '1')) if n > 0 else 1 # This function from Chai Wah Wu def a007947(n): return 1 if n<2 else reduce(mul, primefactors(n)) def a065642(n): if n==1: return 1 r=a007947(n) n += r while a007947(n)!=r: n+=r return n def a(n): return a065642(a065642(a019565(n)))//a019565(n) print([a(n) for n in range(101)]) # Indranil Ghosh, Apr 20 2017
-
Scheme
(define (A285323 n) (/ (A065642 (A065642 (A019565 n))) (A019565 n))) (define (A285323 n) (cond ((zero? n) 1) ((or (= 1 (A000120 n)) (> (A000040 (+ 1 (A285099 n))) (A000290 (A000040 (+ 1 (A007814 n)))))) (A000290 (A000040 (+ 1 (A007814 n))))) (else (A000040 (+ 1 (A285099 n))))))
Comments