login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180419 a(n) = (A000111(2*p) - 1)/(2*p), where p = A000040(n) = prime(n). 1
1, 10, 5052, 14240070, 3152221563324450, 157195096511273995860, 2374214683408467590063771983920, 618146855974818638210995488847340730, 144946467754033586465978879886385830380958862710 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
My comment in A000111 concerning A000111(2*p) mod (2*p) says that all entries are integers.
LINKS
MATHEMATICA
t = Range[0, 60]! CoefficientList[ Series[ Sec@x + Tan@x, {x, 0, 60}], x]; f[n_] := (Rest[t][[2 Prime@n]] - 1)/(2 Prime@n); Array[f, 9] (* Robert G. Wilson v, Sep 04 2010 *)
PROG
(Python)
from sympy import euler, prime
def A180419(n): return (1-euler(2*(p:=prime(n))))//p>>1 if n > 1 else 1 # Chai Wah Wu, Apr 18 2023
CROSSREFS
Sequence in context: A273415 A223055 A308488 * A061888 A348082 A117803
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Sep 03 2010
EXTENSIONS
a(6) onwards from Robert G. Wilson v, Sep 04 2010
Definition rephrased by R. J. Mathar, Sep 29 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)