Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076237
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076237 Remainder when 2nd order composite cc[n]=A050435[n] is divided by n. +0
3
0, 0, 0, 0, 3, 3, 3, 1, 8, 8, 10, 9, 8, 8, 8, 7, 6, 6, 7, 8, 7, 6, 5, 4, 5, 4, 3, 4, 5, 4, 3, 4, 3, 2, 2, 2, 2, 1, 0, 0, 40, 0, 0, 43, 43, 44, 44, 45, 45, 45, 47, 48, 49, 50, 50, 50, 53, 53, 53, 55, 55, 55, 55, 55, 56, 56, 56, 56, 56, 56, 57, 58, 59, 59, 60, 62, 63, 63, 64, 65, 65, 65, 67 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n) = Mod[cc[n], n] = Mod[A050435(n), n]

CROSSREFS

Cf. A002808, A050435-A050439, A065860, A076236-A076239.

Sequence in context: A123073 A059289 A014465 this_sequence A128210 A016651 A135877

Adjacent sequences: A076234 A076235 A076236 this_sequence A076238 A076239 A076240

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 08 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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research