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.

A324057 a(n) = A106315(A005940(1+n)).

This page as a plain text file.
%I A324057 #7 Feb 16 2019 20:38:36
%S A324057 0,1,2,5,4,0,1,2,6,4,12,16,13,30,28,18,10,8,20,36,44,24,36,12,33,21,
%T A324057 78,51,32,72,42,3,12,16,36,0,4,48,66,50,20,128,72,48,58,144,120,108,
%U A324057 97,75,198,32,102,312,10,84,172,128,504,176,1,168,2,67,16,20,44,12,8,96,126,88,28,16,168,112,162,264,232,56,68,80,312,0,200,480,36,120
%N A324057 a(n) = A106315(A005940(1+n)).
%H A324057 Antti Karttunen, <a href="/A324057/b324057.txt">Table of n, a(n) for n = 0..8191</a>
%H A324057 Antti Karttunen, <a href="/A324057/a324057.txt">Data supplement: n, a(n) computed for n = 0..70327</a>
%F A324057 a(n) = A106315(A005940(1+n)).
%F A324057 a(n) = A005940(1+n)*A106737(n) mod A324054(n).
%o A324057 (PARI)
%o A324057 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
%o A324057 A106315(n) = (n*numdiv(n) % sigma(n));
%o A324057 A324057(n) = A106315(A005940(1+n));
%Y A324057 Cf. A005940, A106737, A106315, A324054, A324055, A324058.
%K A324057 nonn
%O A324057 0,3
%A A324057 _Antti Karttunen_, Feb 14 2019