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.

A340194 a(n) = A337544(A003961(n)).

This page as a plain text file.
%I A340194 #10 Jan 06 2021 17:48:16
%S A340194 1,3,5,15,9,13,11,75,35,25,15,65,17,31,43,375,21,91,27,125,53,43,29,
%T A340194 325,99,49,245,155,35,95,39,1875,73,61,97,455,41,79,83,625,45,121,51,
%U A340194 215,301,85,57,1625,143,275,103,245,59,637,133,775,133,103,65,475,69,115,371,9375,151,173,71,305,143,245,77,2275,81,121
%N A340194 a(n) = A337544(A003961(n)).
%C A340194 First negative term is a(510510) = -686785. See A001276.
%H A340194 Antti Karttunen, <a href="/A340194/b340194.txt">Table of n, a(n) for n = 1..16383</a>
%H A340194 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A340194 a(n) = A337544(A003961(n)) = A083254(A003961(A003961(n))).
%o A340194 (PARI)
%o A340194 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f);
%o A340194 A083254(n) = (2*eulerphi(n)-n);
%o A340194 A340194(n) = A083254(A003961(A003961(n)));
%Y A340194 Cf. A001276, A003961, A003972, A083254, A337544.
%K A340194 sign
%O A340194 1,2
%A A340194 _Antti Karttunen_, Dec 31 2020