Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116564
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116564 Ono supersingular invariant power function. +0
1
0, 0, 0, 0, 0, 0, 2, 2, 2, 2, 6, 6, 12, 12, 20, 12, 20, 30, 20, 30, 42, 42, 42, 56, 56, 72, 56, 72, 90, 110, 110, 110, 132, 132, 132, 156, 182, 182, 210, 182, 240, 210, 240, 240, 272, 306, 342, 306 (list; graph; listen)
OFFSET

0,7

REFERENCES

Ken Ono and Scott Ahlgren, Weierstrass points on X0(p) and supersingular j-invariants Mathematiche Annalen 325, 2003, pp. 355-368

FORMULA

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(n) =g[n]*(g[n]-1)

MATHEMATICA

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 b = Table[g[n]*(g[n] - 1), {n, 3, 50}]

CROSSREFS

Adjacent sequences: A116561 A116562 A116563 this_sequence A116565 A116566 A116567

Sequence in context: A048764 A038714 A139554 this_sequence A078014 A063867 A024723

KEYWORD

nonn,uned,probation,obsc

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 17 2006

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 October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research