The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A323070

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

A323070

Numbers k such that A055023(k) != A323071(k), where A323071(k) = gcd(k, 1+A060681(k)).
(history; published version)

#15 by Michel Marcus at Sat Jul 17 13:31:20 EDT 2021

STATUS

reviewed

approved

#14 by Joerg Arndt at Sat Jul 17 07:11:02 EDT 2021

STATUS

proposed

reviewed

#13 by Joerg Arndt at Sat Jul 17 07:10:59 EDT 2021

STATUS

editing

proposed

#12 by Joerg Arndt at Sat Jul 17 07:10:57 EDT 2021

NAME

Numbers k such that A055023(k) <> != A323071(k), where A323071(k) = gcd(k, 1+A060681(k)).

STATUS

proposed

editing

#11 by Jon E. Schoenfield at Sat Jul 17 05:12:52 EDT 2021

STATUS

editing

proposed

Discussion

Sat Jul 17

07:04

Hugo Pfoertner: Why are different representations of  "not equal" used in name and in comment?

#10 by Jon E. Schoenfield at Sat Jul 17 05:12:51 EDT 2021

NAME

Numbers n k such that A055023(nk) <> A323071(nk), where A323071(nk) = gcd(n, k, 1+A060681(nk)).

COMMENTS

Equivalently, numbers n k for which A055032(nk) != A323072(nk).

STATUS

approved

editing

#9 by Susanna Cuyler at Sat Jan 05 08:20:35 EST 2019

STATUS

proposed

approved

#8 by Antti Karttunen at Sat Jan 05 04:48:47 EST 2019

STATUS

editing

proposed

#7 by Antti Karttunen at Sat Jan 05 04:48:16 EST 2019

PROG

A055023(n) = (n/denominator((sum(m=1, n - 1, m^(n - 1)) + 1)/n)); \\ From A055023.

A055023.

#6 by Antti Karttunen at Sat Jan 05 04:47:50 EST 2019

PROG

A055023(n) = (n/denominator((sum(m=1, n - 1, m^(n - 1)) + 1)/n)); \\ From

A055023.