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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065860 Remainder when the n-th composite number is divided by n. 8
0, 0, 2, 1, 0, 0, 0, 7, 7, 8, 9, 9, 9, 10, 10, 10, 10, 10, 11, 12, 12, 12, 12, 12, 13, 13, 13, 14, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 19, 19, 19, 19, 19, 20, 20, 20, 21, 22, 22, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 26, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = A002808(n) mod n.

EXAMPLE

n=100, c(100)=133, a(100)=33.

PROG

(PARI) Composite(n) = { local(k); k=n + primepi(n) + 1; while (k != n + primepi(k) + 1, k = n + primepi(k) + 1); return(k) } { for (n = 1, 1000, a=Composite(n)%n; write("b065860.txt", n, " ", a) ) } \\ Harry J. Smith, Nov 02 2009

CROSSREFS

Cf. A002808, A065855-A065864.

Sequence in context: A212868 A184616 A261139 * A010110 A116905 A115079

Adjacent sequences:  A065857 A065858 A065859 * A065861 A065862 A065863

KEYWORD

nonn

AUTHOR

Labos Elemer, Nov 26 2001

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 26 09:57 EDT 2019. Contains 323579 sequences. (Running on oeis4.)