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.

A354350 a(n) = n + A354365(n).

This page as a plain text file.
%I A354350 #9 Jun 08 2022 14:24:03
%S A354350 2,0,0,4,0,9,0,8,9,20,0,12,0,28,20,16,0,18,0,20,42,44,0,24,25,52,27,
%T A354350 28,0,25,0,32,66,68,42,36,0,76,78,40,0,21,0,44,45,92,0,48,49,50,102,
%U A354350 52,0,54,110,56,114,116,0,60,0,124,63,64,130,33,0,68,138,56,0,72,0,148,75,76,88,39,0,80,81,164,0,84,170
%N A354350 a(n) = n + A354365(n).
%H A354350 Antti Karttunen, <a href="/A354350/b354350.txt">Table of n, a(n) for n = 1..12001</a>
%H A354350 Antti Karttunen, <a href="/A354350/a354350.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A354350 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A354350 a(n) = n + A354365(n).
%o A354350 (PARI)
%o A354350 A064989(n) = { my(f = factor(n)); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f); };
%o A354350 A354350(n) = (n+numerator((moebius(n)*n)/A064989(n)));
%Y A354350 Cf. A008683, A055615, A064989, A354365.
%K A354350 nonn
%O A354350 1,1
%A A354350 _Antti Karttunen_, Jun 07 2022