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.

A354103 a(n) = sigma(A267099(n)), where A267099 is fully multiplicative involution swapping the positions of 4k+1 and 4k+3 primes, and sigma is the sum of divisors function.

This page as a plain text file.
%I A354103 #10 May 19 2022 16:42:53
%S A354103 1,3,6,7,4,18,14,15,31,12,18,42,8,42,24,31,12,93,30,28,84,54,38,90,13,
%T A354103 24,156,98,20,72,42,63,108,36,56,217,24,90,48,60,32,252,54,126,124,
%U A354103 114,62,186,183,39,72,56,44,468,72,210,180,60,74,168,48,126,434,127,32,324,90,84,228,168,98,465,60,72,78,210
%N A354103 a(n) = sigma(A267099(n)), where A267099 is fully multiplicative involution swapping the positions of 4k+1 and 4k+3 primes, and sigma is the sum of divisors function.
%H A354103 Antti Karttunen, <a href="/A354103/b354103.txt">Table of n, a(n) for n = 1..19683</a>
%F A354103 a(n) = A000203(A267099(n)).
%F A354103 a(n) = Sum_{d|n} A267099(d).
%o A354103 (PARI) A354103(n) = sigma(A267099(n)); \\ Uses the program given in A267099.
%Y A354103 Inverse Möbius transform of A267099.
%Y A354103 Cf. A000203, A354102.
%K A354103 nonn,mult
%O A354103 1,2
%A A354103 _Antti Karttunen_, May 18 2022