|
|
|
|
| A338133
|
|
Primitive nondeficient numbers sorted by largest prime factor then by increasing size. Irregular triangle T(n, k), n >= 2, k >= 1, read by rows, row n listing those with largest prime factor = prime(n).
(history;
published version)
|
|
|
|
|
#33 by Michael De Vlieger at Tue Nov 29 12:53:10 EST 2022
|
|
|
|
|
|
|
|
#32 by Antti Karttunen at Tue Nov 29 12:53:01 EST 2022
|
|
|
|
|
|
|
|
#31 by Antti Karttunen at Tue Nov 29 09:31:55 EST 2022
|
|
| LINKS
|
<a href="/index/O#opnseqs">Index entries for sequences where any odd perfect numbers must occur</a>
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#30 by N. J. A. Sloane at Wed Oct 06 19:42:02 EDT 2021
|
|
|
|
|
|
|
|
#29 by Peter Munn at Tue Sep 07 08:35:48 EDT 2021
|
|
|
|
|
|
|
|
#28 by Peter Munn at Tue Sep 07 08:26:50 EDT 2021
|
|
| COMMENTS
|
The last number in row n (therefore the largest that is prime(n)-smooth) is A338427(n). - Peter Munn, Sep 06 2021
The largest number in rows 2..n (therefore the largest that is prime(n)-smooth) is A338427(n). - Peter Munn, Sep 07 2021
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Tue Sep 07
| 08:32
| Peter Munn: Recognising that for some n, A338427(n) is the last number in row k, k < n.
|
|
|
|
|
|
|
#27 by Peter Munn at Mon Sep 06 13:12:24 EDT 2021
|
|
|
|
|
|
|
|
#26 by Peter Munn at Mon Sep 06 13:07:42 EDT 2021
|
|
|
|
|
|
Discussion
|
| Mon Sep 06
| 13:11
| Peter Munn: This seems to fit well positioned immediately after the comment explaining why the rows are finite.
|
|
|
|
|
|
|
#25 by N. J. A. Sloane at Sat Nov 07 11:37:32 EST 2020
|
|
|
|
|
|
|
|
#24 by Peter Munn at Sat Nov 07 10:17:35 EST 2020
|
|
|
|
|
|
|
