|
Search: id:A116579
|
|
|
| A116579 |
|
A prime genus function modulo 6. |
|
+0
1
|
|
| 1, 1, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 11, 11, 12, 13, 13, 14, 16, 16, 17, 17, 18, 18, 21, 21, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 35, 37, 37, 38
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
genus_mod[6]=2*genus_mod12[n]*Parity[n] Limit[Prime[n]/genus_mod[6],n->Infinity]=6 in two distinct lines instead of fourv as with modulo 12 and modulo 5 geneus functions.
|
|
FORMULA
|
h[1] = 1; h[2] = 1; h[n_] := (Prime[n])/6 /; Mod[Prime[n], 6] == 0 h[n_] := (Prime[n] - 1)/6 /; Mod[Prime[n], 6] - 1 == 0 h[n_] := (Prime[n] - 2)/6 /; Mod[Prime[n], 6] - 2 == 0 h[n_] := (Prime[n] - 3)/6 /; Mod[Prime[n], 6] - 3 == 0 h[n_] := (Prime[n] - 4)/6 /; Mod[Prime[n], 6] - 4 == 0 h[n_] := (Prime[n] - 5)/6 /; Mod[Prime[n], 6] - 5 == 0 a(n) = h[n]
|
|
MATHEMATICA
|
h[1] = 1; h[2] = 1; h[n_] := (Prime[n])/6 /; Mod[Prime[n], 6] == 0 h[n_] := (Prime[n] - 1)/6 /; Mod[Prime[n], 6] - 1 == 0 h[n_] := (Prime[n] - 2)/6 /; Mod[Prime[n], 6] - 2 == 0 h[n_] := (Prime[n] - 3)/6 /; Mod[Prime[n], 6] - 3 == 0 h[n_] := (Prime[n] - 4)/6 /; Mod[Prime[n], 6] - 4 == 0 h[n_] := (Prime[n] - 5)/6 /; Mod[Prime[n], 6] - 5 == 0
|
|
CROSSREFS
|
Sequence in context: A030565 A072509 A062298 this_sequence A060151 A097330 A086861
Adjacent sequences: A116576 A116577 A116578 this_sequence A116580 A116581 A116582
|
|
KEYWORD
|
nonn,uned,probation,obsc
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 21 2006
|
|
|
Search completed in 0.002 seconds
|
