Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073367
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073367 Remainder when n-th composite is divided by number of composites not exceeding n. +0
2
0, 0, 0, 0, 0, 0, 3, 0, 3, 4, 3, 1, 8, 0, 8, 0, 10, 9, 8, 9, 8, 8, 7, 6, 6, 8, 7, 8, 8, 7, 6, 5, 4, 6, 5, 4, 3, 4, 4, 6, 5, 4, 3, 4, 4, 3, 2, 2, 2, 3, 2, 1, 0, 0, 40, 0, 0, 1, 0, 43, 43, 44, 44, 45, 45, 45, 45, 46, 47, 48, 48, 49, 50, 50, 50, 52, 53, 53, 53, 55, 55, 55, 55, 55, 55, 56, 56, 56 (list; graph; listen)
OFFSET

4,7

FORMULA

a(n)=Mod[A002808(n), A065855(n)]

EXAMPLE

n=4: a(4)=Mod[composite(4),4-Pi(4)-1]=Mod[9,1]=0; n=19: a(19)=Mod[composite(19),19-Pi(19)-1]=Mod[30,10]=0;

MATHEMATICA

f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] Table[Mod[f[w], w-PrimePi[w]-1], {w, 1, 128}]

CROSSREFS

Cf. A002808, A065855.

Adjacent sequences: A073364 A073365 A073366 this_sequence A073368 A073369 A073370

Sequence in context: A078907 A111815 A127753 this_sequence A111862 A060858 A127749

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 30 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research