Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076239
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076239 Remainder when 3rd order composite ccc[n]=A050436[n] is divided by n. +0
4
0, 1, 1, 2, 3, 3, 1, 6, 3, 2, 4, 1, 11, 10, 10, 8, 6, 6, 7, 8, 6, 4, 3, 2, 2, 0, 26, 0, 0, 28, 28, 29, 28, 27, 28, 28, 30, 29, 28, 30, 29, 31, 31, 30, 29, 29, 28, 28, 27, 26, 28, 29, 29, 30, 30, 29, 31, 30, 29, 32, 31, 30, 29, 28, 29, 28, 27, 26, 26, 25, 26, 26, 26, 26, 26, 28, 29 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n)=Mod[ccc[n], n]=Mod[A050436(n), n]

CROSSREFS

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

Sequence in context: A120428 A079950 A138677 this_sequence A019798 A120653 A116155

Adjacent sequences: A076236 A076237 A076238 this_sequence A076240 A076241 A076242

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 September 5 19:15 EDT 2008. Contains 143484 sequences.


AT&T Labs Research