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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281908 a(n) = (Sum_{k=1..n} C(n,k) mod k) mod n. 1
0, 1, 2, 2, 3, 2, 2, 3, 6, 3, 3, 2, 1, 0, 2, 14, 13, 13, 12, 8, 18, 16, 14, 20, 2, 23, 24, 21, 19, 22, 19, 15, 21, 2, 25, 6, 1, 26, 25, 38, 33, 4, 42, 19, 34, 19, 14, 38, 31, 18, 22, 20, 14, 42, 29, 13, 9, 44, 38, 39, 31, 9, 4, 9, 25, 7, 63, 22, 2, 17, 7, 38, 27, 44, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Michel Marcus, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = A076541(n) mod n.

PROG

(PARI) a(n) = sum(k=1, n, binomial(n, k) % k) % n;

CROSSREFS

Cf. A076541, A081371, A280559.

Sequence in context: A108939 A138143 A285727 * A106441 A131836 A133829

Adjacent sequences:  A281905 A281906 A281907 * A281909 A281910 A281911

KEYWORD

nonn

AUTHOR

Michel Marcus, Feb 01 2017

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 May 24 14:49 EDT 2019. Contains 323532 sequences. (Running on oeis4.)