Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

COMMENT

Binary sequence based on the primes used to make a drum-like sound.

MATHEMATICA

a = Table[If[Mod[Prime[n], 3] == 0, 1, If[Mod[Prime[n], 3] == 1, 0, 1]], {n, 1, 256}]

CROSSREFS

Cf. A130198.

Sequence in context: A075439 A104338 A071023 this_sequence A092079 A139312 A071041

Adjacent sequences: A132191 A132192 A132193 this_sequence A132195 A132196 A132197

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 05 2007

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 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research