OFFSET
0,3
COMMENTS
Möbius transform of A380444(n) (n>0). - Wesley Ivan Hurt, Jun 21 2025
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..5000
FORMULA
a(n) = (n! mod n^2) + n, n>0, n != 4. - Gary Detlefs, Feb 21 2011
From Wesley Ivan Hurt, Jun 21 2025: (Start)
a(n) = n + n*(n-1)*c(n) where c = A010051 (n>0).
a(n) = n^tau(n^c(n)), where c = A010051 (n>0).
a(n) = Sum_{d|n} A380444(d) * mu(n/d), (n>0). (End)
EXAMPLE
a(4) = 4 because 4 is composite.
a(5) = 25 because 5 is prime and 5^2 = 25.
MATHEMATICA
Table[ If[ !PrimeQ[n], n, n^2], {n, 0, 64}] (* Robert G. Wilson v, Mar 19 2005 *)
PROG
(Magma) [0] cat [IsPrime(n) select n^2 else n: n in [1..70]]; // Vincenzo Librandi, Feb 17 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Parthasarathy Nambi, Mar 17 2005
EXTENSIONS
More terms from Robert G. Wilson v, Mar 19 2005
STATUS
approved
