Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)

Revision History for A333820

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A333820 a(n) is the number of pairs (q,r) such that q <= r and phi(q) + phi(r) = 2*n.
(history; published version)
#25 by Peter Luschny at Sat Apr 11 06:28:46 EDT 2020
STATUS

reviewed

approved

#24 by Joerg Arndt at Sat Apr 11 05:45:58 EDT 2020
STATUS

proposed

reviewed

#23 by Michel Marcus at Sat Apr 11 00:41:36 EDT 2020
STATUS

editing

proposed

#22 by Michel Marcus at Sat Apr 11 00:41:32 EDT 2020
COMMENTS

Paul Erdöős and Leo Moser conjectured that, for any even numbers 2*n, there exist integers q and r such that phi(q) + phi(r) = 2*n. Therefore, they conjecture a(n) > 0 for all ns.

STATUS

approved

editing

#21 by N. J. A. Sloane at Thu Apr 09 22:24:43 EDT 2020
STATUS

proposed

approved

#20 by Robert G. Wilson v at Thu Apr 09 22:20:03 EDT 2020
STATUS

editing

proposed

#19 by Robert G. Wilson v at Thu Apr 09 22:19:59 EDT 2020
NAME

a(n) is the number of unique solutionspairs (q,r) such that for some q & <= r withand q =< r, phi(q) + phi(r) = 2*n.

#18 by N. J. A. Sloane at Thu Apr 09 20:51:26 EDT 2020
STATUS

proposed

editing

#17 by Robert G. Wilson v at Tue Apr 07 15:14:11 EDT 2020
STATUS

editing

proposed

Discussion
Tue Apr 07 15:15
Robert G. Wilson v: They're fixed.
Thu Apr 09 20:51
N. J. A. Sloane: Have you perhaps written "unique" when you meant to say "distinct" ?  Even so, the definition does not really make sense.  Why not simply say something like this:  a(n) is the number of pairs (q,r) such that q =< r and  phi(q) + phi(r) = 2*n.  Also remember that one says <= not =<.
#16 by Robert G. Wilson v at Tue Apr 07 15:14:07 EDT 2020
COMMENTS

Paul Erdös and Leo Moser conjectured that, for any even numbers 2*n, there exist integers q and r such that phi(q) + phi(r) = 2*n. Therefore, they conjecture a(n) > 0 for all ns.

EXAMPLE

a(2) = 6 because for the pairs {q, r} the following pairs when phi(q) + phi(r) = 4; {3,3},{}, {3,4},{}, {3,6},{}, {4,4},{}, {4,6},{}, {6,6}.

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 August 19 13:48 EDT 2024. Contains 375302 sequences. (Running on oeis4.)