[go: up one dir, main page]

login
Revision History for A363039 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) is the smallest tribonacci number (A000073) with exactly n divisors, or -1 if no such number exists.
(history; published version)
#18 by Hugo Pfoertner at Fri May 19 13:23:57 EDT 2023
STATUS

reviewed

approved

#17 by Amiram Eldar at Fri May 19 13:18:03 EDT 2023
STATUS

proposed

reviewed

#16 by Amiram Eldar at Fri May 19 13:17:49 EDT 2023
STATUS

editing

proposed

#15 by Amiram Eldar at Fri May 19 13:17:46 EDT 2023
LINKS

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TribonacciNumber.html">Tribonacci Number</a>.

<a href="/index/Di#divisors">Index entries for sequences related to divisors of numbers</a>.

STATUS

proposed

editing

#14 by Michel Marcus at Fri May 19 12:57:09 EDT 2023
STATUS

editing

proposed

#13 by Michel Marcus at Fri May 19 12:57:04 EDT 2023
LINKS

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TribonacciNumber.html">Tribonacci Number</a>

Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TribonacciNumber.html">Tribonacci Number</a>

STATUS

approved

editing

#12 by Michael De Vlieger at Fri May 19 09:18:14 EDT 2023
STATUS

reviewed

approved

#11 by Vaclav Kotesovec at Fri May 19 08:13:29 EDT 2023
STATUS

proposed

reviewed

#10 by Michael S. Branicky at Wed May 17 11:30:14 EDT 2023
STATUS

editing

proposed

#9 by Michael S. Branicky at Wed May 17 11:29:59 EDT 2023
COMMENTS

Has an infinite number of -1's for a(p) where p is prime as A000073 only contains a finite number of perfect powers (see Theorem 1 of Petho link). - Michael S. Branicky, May 17 2023

LINKS

Attila Petho, <a href="https://www.emis.de/journals/AUSM/C2-1/math21-5.pdf">"Fifteen problems in number theory."</a> , Acta Univ. Sapientiae Math 2, no. :1 (2010): , 72-83.

STATUS

proposed

editing