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.

A349137 a(n) = phi(A003602(n)), where A003602 is Kimberling's paraphrases, and phi is Euler totient function.

This page as a plain text file.
%I A349137 #10 Nov 14 2021 17:14:12
%S A349137 1,1,1,1,2,1,2,1,4,2,2,1,6,2,4,1,6,4,4,2,10,2,4,1,12,6,6,2,8,4,8,1,16,
%T A349137 6,6,4,18,4,8,2,12,10,10,2,22,4,8,1,20,12,12,6,18,6,12,2,28,8,8,4,30,
%U A349137 8,16,1,20,16,16,6,24,6,12,4,36,18,18,4,24,8,16,2,40,12,12,10,42,10,20,2,24,22,22,4,46
%N A349137 a(n) = phi(A003602(n)), where A003602 is Kimberling's paraphrases, and phi is Euler totient function.
%H A349137 Antti Karttunen, <a href="/A349137/b349137.txt">Table of n, a(n) for n = 1..20000</a>
%F A349137 a(n) = A000010(A003602(n)).
%F A349137 For all n >= 1, a(n) = a(2*n) = a(A000265(n)), a(2n-1) = A000010(n).
%o A349137 (PARI)
%o A349137 A003602(n) = (1+(n>>valuation(n,2)))/2;
%o A349137 A349137(n) = eulerphi(A003602(n));
%Y A349137 Cf. A000010, A000265, A003602, A349138 (inverse Möbius transform).
%Y A349137 Cf. also A349136.
%K A349137 nonn
%O A349137 1,5
%A A349137 _Antti Karttunen_, Nov 13 2021