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.

A344761 "Twisted variant" of A342002: a(n) = A342001(A328624(n)) = A342002(A328625(n)).

This page as a plain text file.
%I A344761 #9 May 29 2021 20:02:42
%S A344761 0,1,1,7,2,5,1,7,11,47,19,43,2,9,17,59,13,31,3,11,8,41,22,49,4,13,14,
%T A344761 53,16,37,1,9,10,55,17,41,17,69,107,389,163,361,29,93,164,503,136,307,
%U A344761 41,117,116,407,214,463,53,141,173,521,187,409,2,11,13,61,20,47,27,89,137,449,193,421,44,123,209,593,181
%N A344761 "Twisted variant" of A342002: a(n) = A342001(A328624(n)) = A342002(A328625(n)).
%H A344761 Antti Karttunen, <a href="/A344761/b344761.txt">Table of n, a(n) for n = 0..11550</a>
%H A344761 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A344761 a(n) = A342001(A328624(n)) = A342002(A328625(n)).
%o A344761 (PARI)
%o A344761 A328624(n) = { my(m=1, p=2, e, g=1); while(n, e = (n%p); m *= (p^((g*e)%p)); g = e+1; n = n\p; p = nextprime(1+p)); (m); };
%o A344761 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A344761 A003557(n) = (n/factorback(factorint(n)[, 1]));
%o A344761 A342001(n) = (A003415(n) / A003557(n));
%o A344761 A344761(n) = A342001(A328624(n));
%Y A344761 Cf. A003415, A003557, A276086, A328624, A328625, A342001, A342002.
%Y A344761 Cf. also A344762 (another variant based on inverse of A328625).
%K A344761 nonn,look
%O A344761 0,4
%A A344761 _Antti Karttunen_, May 29 2021