login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216369 a(n) = !(n-1) mod n. 1
0, 0, 1, 2, 4, 2, 6, 6, 1, 6, 1, 2, 10, 8, 4, 6, 13, 8, 9, 6, 13, 10, 21, 14, 14, 16, 10, 22, 17, 26, 2, 6, 1, 4, 34, 26, 5, 10, 10, 6, 4, 8, 16, 10, 19, 2, 18, 38, 48, 36, 13, 42, 13, 44, 34, 22, 28, 12, 28, 26, 22, 60, 55, 38, 49, 32, 65, 38, 67, 36, 68, 62 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

!n is a subfactorial number (A000166).

LINKS

Indranil Ghosh, Table of n, a(n) for n = 1..10000

EXAMPLE

a(7)=6 because !(7-1) = 265, and 265 == 6 mod 7.

MAPLE

with(numtheory): f:=n->sum(n!*(((-1)^k)*1/k!), k=0..n):for n from 1 to 150 do:  x:=irem(f(n-1), n): printf(`%d, `, x):od:

CROSSREFS

Cf. A000166, A124625.

Sequence in context: A049200 A164701 A198540 * A083791 A303347 A250222

Adjacent sequences:  A216366 A216367 A216368 * A216370 A216371 A216372

KEYWORD

nonn

AUTHOR

Michel Lagneau, Sep 05 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 12:11 EDT 2019. Contains 321470 sequences. (Running on oeis4.)