The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A296079 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A296079

a(n) = 1 if 1+phi(n) is prime, 0 otherwise, where phi = A000010, Euler totient function.
(history; published version)

#17 by Harvey P. Dale at Thu Apr 23 15:33:00 EDT 2020

STATUS

editing

approved

#16 by Harvey P. Dale at Thu Apr 23 15:32:57 EDT 2020

MATHEMATICA

Table[If[PrimeQ[EulerPhi[n]+1], 1, 0], {n, 120}] (* Harvey P. Dale, Apr 23 2020 *)

STATUS

approved

editing

#15 by Susanna Cuyler at Tue Dec 25 11:36:29 EST 2018

STATUS

reviewed

approved

#14 by Joerg Arndt at Tue Dec 25 11:17:51 EST 2018

STATUS

proposed

reviewed

#13 by Jianing Song at Tue Dec 25 10:00:08 EST 2018

STATUS

editing

proposed

#12 by Jianing Song at Tue Dec 25 09:58:02 EST 2018

OFFSET

1,1

STATUS

approved

editing

#11 by Susanna Cuyler at Tue Dec 05 21:22:31 EST 2017

STATUS

proposed

approved

#10 by Antti Karttunen at Tue Dec 05 17:15:19 EST 2017

STATUS

editing

proposed

#9 by Antti Karttunen at Tue Dec 05 17:14:52 EST 2017

FORMULA

For all n, a(n) >= A010051(n) and a(2n) >= A010051(n). - See _Vladimir Shevelev_ second comment dated May 10 2008 in A039698.

Discussion

Tue Dec 05

17:15

Antti Karttunen: Actually, simple, yes.

#8 by Antti Karttunen at Tue Dec 05 17:12:43 EST 2017

FORMULA

For all n, a(n) >= A010051(n) and a(2n) >= A010051(n). - See Vladimir Shevelev second comment dated May 10 2008 in A039698.

STATUS

proposed

editing