|
Search: id:A116569
|
|
|
| A116569 |
|
Ono prime weight function divided by 6. |
|
+0
1
|
|
| 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 4, 4, 10, 10, 20, 10, 20, 35, 20, 35, 56, 56, 56, 84, 84, 120, 84, 120, 165, 220, 220, 220, 286, 286, 286, 364, 455, 455, 560, 455, 680, 560, 680, 680, 816, 969, 1140, 969
(list; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
COMMENT
|
This result uses an improved version of the prime genus function defined for g[1] and g[2].
|
|
REFERENCES
|
Scott Ahlgren and Ken Ono,Weierstrass points on X0(p) and supersingular j-invariants Mathematiche Annalen 325, 2003, pp. 355-368
|
|
FORMULA
|
g[1] = 1; g[2] = 1; g[n_] := (Prime[n] - 13)/12 /; Mod[Prime[n], 12] - 1 == 0 g[n_] := (Prime[n] - 5)/12 /; Mod[Prime[n], 12] - 5 == 0 g[n_] := (Prime[n] - 7)/12 /; Mod[Prime[n], 12] - 7 == 0 g[n_] := (Prime[n] + 1)/12 /; Mod[Prime[n], 12] - 11 == 0 w[n_]:=g[n]*(g[n]^2 - 1) a(n) = w[n]/6
|
|
MATHEMATICA
|
g[1] = 1; g[2] = 1; g[n_] := (Prime[n] - 13)/12 /; Mod[Prime[n], 12] - 1 == 0 g[n_] := (Prime[n] - 5)/12 /; Mod[Prime[n], 12] - 5 == 0 g[n_] := (Prime[n] - 7)/12 /; Mod[Prime[n], 12] - 7 == 0 g[n_] := (Prime[n] + 1)/12 /; Mod[Prime[n], 12] - 11 == 0 a = Table[g[n]*(g[n]^2 - 1)/6, {n, 1, 50}]
|
|
CROSSREFS
|
Sequence in context: A078910 A140234 A101256 this_sequence A058187 A006477 A058596
Adjacent sequences: A116566 A116567 A116568 this_sequence A116570 A116571 A116572
|
|
KEYWORD
|
nonn,uned,probation,obsc
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 18 2006
|
|
|
Search completed in 0.002 seconds
|
