Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099618
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099618 a(n) = 1 if the n-th prime == 1 mod 6, otherwise a(n) = 0. +0
1
0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Table[Mod[Mod[Mod[Mod[Prime[k], 6], 5], 3], 2], {k, 1, 120}]

CROSSREFS

Cf. A000040, A039704, A091178.

Sequence in context: A038189 A072783 A064911 this_sequence A106002 A066247 A151774

Adjacent sequences: A099615 A099616 A099617 this_sequence A099619 A099620 A099621

KEYWORD

nonn

AUTHOR

Joseph Biberstine (jrbibers(AT)indiana.edu), Nov 19 2004

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research