Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065860 Remainder when the n-th composite number is divided by n. +0
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; listen)
OFFSET

1,3

FORMULA

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

EXAMPLE

n=100, c[100]=133, a(100)=33

CROSSREFS

Cf. A002808, A065855-A065864.

Sequence in context: A036869 A036868 A130116 this_sequence A010110 A116905 A115079

Adjacent sequences: A065857 A065858 A065859 this_sequence A065861 A065862 A065863

KEYWORD

nonn

AUTHOR

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

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research