cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A278525 Filtering sequence (related to prime factorization): a(n) = A046523(A241916(n)).

This page as a plain text file.
%I A278525 #10 Jul 02 2018 07:25:09
%S A278525 1,2,2,4,2,4,2,8,6,4,2,8,2,4,6,16,2,12,2,8,6,4,2,16,6,4,12,8,2,12,2,
%T A278525 32,6,4,6,24,2,4,6,16,2,12,2,8,12,4,2,32,6,12,6,8,2,36,6,16,6,4,2,24,
%U A278525 2,4,12,64,6,12,2,8,6,12,2,48,2,4,30,8,6,12,2,32,24,4,2,24,6,4,6,16,2,36,6,8,6,4,6,64,2,12,12,24,2,12,2,16,30,4,2,72,2
%N A278525 Filtering sequence (related to prime factorization): a(n) = A046523(A241916(n)).
%H A278525 Antti Karttunen, <a href="/A278525/b278525.txt">Table of n, a(n) for n = 1..16384</a>
%F A278525 a(n) = A046523(A241916(n)).
%F A278525 Other identities. For all n:
%F A278525 a(2^n) = 2^n.
%F A278525 a(A000040(n)) = 2.
%o A278525 (PARI)
%o A278525 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
%o A278525 A209229(n) = (n && !bitand(n,n-1));
%o A278525 A241916(n) = if(1==A209229(n), n, my(f = factor(2*n), nbf = #f~, igp = primepi(f[nbf,1]), g = f); for(i=1,nbf,g[i,1] = prime(1+igp-primepi(f[i,1]))); factorback(g)/2);
%o A278525 A278525(n) = A046523(A241916(n)); \\ _Antti Karttunen_, Jul 02 2018
%o A278525 (Scheme) (define (A278525 n) (A046523 (A241916 n)))
%Y A278525 Cf. A000040, A046523, A241916, A278220, A278221.
%K A278525 nonn
%O A278525 1,2
%A A278525 _Antti Karttunen_, Nov 30 2016