|
| |
|
|
A073368
|
|
Remainder when n is divided by number of composites not exceeding n.
|
|
0
|
|
|
|
0, 0, 0, 1, 2, 1, 0, 1, 0, 1, 0, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 22, 22, 22, 22, 22, 22
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
4,5
|
|
|
LINKS
|
Table of n, a(n) for n=4..78.
|
|
|
FORMULA
|
a(n)=Mod[n, A065855(n)]
|
|
|
EXAMPLE
|
n=14: a(14)=Mod[14,14-Pi(14)-1]=Mod[14,14-7]=0; n=15: a(15)=Mod[15,15-Pi(15)-1]=Mod[15,7]=1.
|
|
|
MATHEMATICA
|
Table[Mod[w, w-PrimePi[w]-1], {w, 1, 128}]
|
|
|
CROSSREFS
|
Cf. A065855, A073366, A073367.
Sequence in context: A208769 A116683 A079748 * A037889 A098055 A092111
Adjacent sequences: A073365 A073366 A073367 * A073369 A073370 A073371
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 30 2002
|
|
|
STATUS
|
approved
|
| |
|
|
