A141277 a(n) = k(n) mod ((sum of prime factors of k(n))+1), where k(n) = n-th composite.

4, 0, 1, 2, 2, 4, 4, 6, 7, 0, 0, 10, 8, 4, 3, 10, 7, 4, 8, 10, 3, 14, 9, 3, 16, 5, 4, 3, 12, 9, 20, 0, 4, 11, 9, 16, 6, 4, 0, 11, 26, 8, 28, 7, 12, 8, 15, 2, 15, 10, 7, 34, 5, 4, 1, 2, 10, 3, 38, 9, 16, 40, 21, 16, 6, 7, 8, 23, 44, 20, 12, 13, 9, 10, 10, 4, 9, 50, 10, 15, 29, 0, 14, 28, 14, 17, 56

Offset

1,1

Links

Table of n, a(n) for n=1..87.

Example

a(4) = (9 mod 7) = 2 because k(4) = 9 = 3*3 and 6 = 3+3,
a(5) = (10 mod 8) = 2 because k(5) = 10 = 2*5 and 7 = 2+5,
a(10) = (18 mod 9) = 0 because k(10) = 18 = 2*3*3 and 8 = 2+3+3, etc.

Crossrefs

Sequence in context: A294653 A126222 A071637 * A198637 A365094 A179296

Adjacent sequences: A141274 A141275 A141276 * A141278 A141279 A141280

Keyword

nonn

Author

Juri-Stepan Gerasimov, Aug 08 2008

Extensions

a(38), a(39), a(41), a(45), a(61) etc. corrected by R. J. Mathar, Sep 13 2008

Status

approved