[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A072230 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = n! (mod n^2), that is, n factorial modulo n^2.
(history; published version)
#26 by Alois P. Heinz at Tue Nov 26 08:49:46 EST 2024
STATUS

editing

approved

#25 by Alois P. Heinz at Tue Nov 26 08:49:44 EST 2024
COMMENTS

With the exception of n=4, if n is composite, a(n) = 0. If n is prime, a(n) = n*(n-1). For example, a(11) = 11*10 = 110, a(41) = 41*40 = 1640. - Gary Detlefs, May 01 2010

STATUS

approved

editing

#24 by Alois P. Heinz at Tue Nov 26 08:49:29 EST 2024
STATUS

editing

approved

#23 by Alois P. Heinz at Tue Nov 26 08:49:27 EST 2024
CROSSREFS
STATUS

approved

editing

#22 by Joerg Arndt at Tue Jun 22 08:26:24 EDT 2021
STATUS

editing

approved

#21 by Joerg Arndt at Tue Jun 22 08:26:20 EDT 2021
COMMENTS

a(n) = A174530(n)*(A174530(n)-1) for n>=5. - Filip Zaludek, Oct 13 2016

FORMULA

a(n) = A174530(n)*(A174530(n)-1) for n>=5. - Filip Zaludek, Oct 13 2016

AUTHOR

_Roman Stawski (roman.stawski(AT)wanadoo.fr), _, Jul 05 2002

STATUS

approved

editing

#20 by Joerg Arndt at Sun Nov 13 06:35:23 EST 2016
STATUS

reviewed

approved

#19 by Danny Rorabaugh at Sat Nov 12 20:55:41 EST 2016
STATUS

proposed

reviewed

#18 by Michael De Vlieger at Fri Oct 14 09:09:10 EDT 2016
STATUS

editing

proposed

Discussion
Mon Oct 24
06:59
Filip Zaludek: Michel, how complicated is your 2nd thought?
#17 by Michael De Vlieger at Fri Oct 14 09:08:54 EDT 2016
MATHEMATICA

Table[Mod[n!, n^2], {n, 79}] (* or *)

Table[Which[n == 4, Mod[n!, n^2], PrimeQ@ n, n (n - 1), True, 0], {n, 79}] (* Michael De Vlieger, Oct 14 2016 *)

STATUS

proposed

editing