Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076236
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076236 Remainder when 2nd order composite cc[n]=A050435[n] is divided by first order composite, A002808[n]. +0
4
1, 0, 7, 7, 8, 9, 10, 10, 10, 10, 12, 12, 12, 12, 13, 13, 13, 14, 15, 16, 16, 16, 16, 16, 17, 17, 17, 18, 19, 19, 19, 20, 20, 20, 21, 22, 22, 22, 22, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 25, 26, 26, 27, 28, 28, 28, 30, 30, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32 (list; graph; listen)
OFFSET

1,3

FORMULA

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

CROSSREFS

Cf. A002808, A050435-A050439, A065860, A076237-39.

Sequence in context: A096251 A108186 A024818 this_sequence A072520 A110941 A021566

Adjacent sequences: A076233 A076234 A076235 this_sequence A076237 A076238 A076239

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 December 3 14:12 EST 2008. Contains 151279 sequences.


AT&T Labs Research