Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054763 Residues of consecutive prime differences modulo 6. +0
5
1, 2, 2, 4, 2, 4, 2, 4, 0, 2, 0, 4, 2, 4, 0, 0, 2, 0, 4, 2, 0, 4, 0, 2, 4, 2, 4, 2, 4, 2, 4, 0, 2, 4, 2, 0, 0, 4, 0, 0, 2, 4, 2, 4, 2, 0, 0, 4, 2, 4, 0, 2, 4, 0, 0, 0, 2, 0, 4, 2, 4, 2, 4, 2, 4, 2, 0, 4, 2, 4, 0, 2, 0, 0, 4, 0, 2, 4, 2, 4, 2, 4, 2, 0, 4, 0, 2, 4, 2, 4, 0, 2, 4, 2, 4, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0 (list; graph; listen)
OFFSET

1,2

COMMENT

Only r=0 is repeated more than twice, while the 0-residue may arise several times after each other.

FORMULA

a(n)= Mod[A001223(n), 6]

CROSSREFS

Cf. A001223.

Sequence in context: A131817 A138232 A102641 this_sequence A100374 A045841 A040003

Adjacent sequences: A054760 A054761 A054762 this_sequence A054764 A054765 A054766

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 17 2000

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research