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.
%I A103164 #23 Jun 21 2025 18:39:32
%S A103164 0,1,4,9,4,25,6,49,8,9,10,121,12,169,14,15,16,289,18,361,20,21,22,529,
%T A103164 24,25,26,27,28,841,30,961,32,33,34,35,36,1369,38,39,40,1681,42,1849,
%U A103164 44,45,46,2209,48,49,50,51,52,2809,54,55,56,57,58,3481,60,3721,62,63,64
%N A103164 Integers but with the primes squared.
%C A103164 Möbius transform of A380444(n) (n>0). - _Wesley Ivan Hurt_, Jun 21 2025
%H A103164 Vincenzo Librandi, <a href="/A103164/b103164.txt">Table of n, a(n) for n = 0..5000</a>
%F A103164 a(n) = (n! mod n^2) + n, n>0, n != 4. - _Gary Detlefs_, Feb 21 2011
%F A103164 From _Wesley Ivan Hurt_, Jun 21 2025: (Start)
%F A103164 a(n) = n + n*(n-1)*c(n) where c = A010051 (n>0).
%F A103164 a(n) = n^tau(n^c(n)), where c = A010051 (n>0).
%F A103164 a(n) = Sum_{d|n} A380444(d) * mu(n/d), (n>0). (End)
%e A103164 a(4) = 4 because 4 is composite.
%e A103164 a(5) = 25 because 5 is prime and 5^2 = 25.
%t A103164 Table[ If[ !PrimeQ[n], n, n^2], {n, 0, 64}] (* _Robert G. Wilson v_, Mar 19 2005 *)
%o A103164 (Magma) [0] cat [IsPrime(n) select n^2 else n: n in [1..70]]; // _Vincenzo Librandi_, Feb 17 2017
%Y A103164 Cf. A000005, A010051.
%K A103164 easy,nonn
%O A103164 0,3
%A A103164 _Parthasarathy Nambi_, Mar 17 2005
%E A103164 More terms from _Robert G. Wilson v_, Mar 19 2005