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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065864 Remainder when n is divided by the number of nonprimes not exceeding n. 7
0, 0, 0, 0, 1, 0, 1, 0, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 21, 21 (list; graph; refs; listen; history; internal format)
OFFSET

1,9

LINKS

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

FORMULA

a(n) = Mod[n, n-Pi[n]] = Mod[n, n-A000720(n)] = Mod[n, A062298(n)]

EXAMPLE

n=100, Pi[100]=25, Mod[100,100-25]=25=a(100)

PROG

(PARI) { for (n = 1, 1000, a=n%(n - primepi(n)); write("b065864.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 02 2009]

CROSSREFS

Cf. A000040, A062298, A065858-A065864, A065134, A004648, A065133, A065134

Sequence in context: A080800 A140341 A003869 * A120205 A152465 A082968

Adjacent sequences:  A065861 A065862 A065863 * A065865 A065866 A065867

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 26 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 09:00 EST 2012. Contains 205904 sequences.