|
%I #18 Jul 29 2019 17:00:12
%S 1,2,3,5,7,11,15,22,6,14,4,77,101,9,8,21,27,35,10,19,12,167,251,25,89,
%T 28,43,13,55,467,311,23,49,1231,33,17977,281,121,45,42,193,2417,71,31,
%U 41,73,38,7013,275,9283,363,53,63,17,142,47,102359,20,44,139
%N a(n) is the smallest divisor of the partition number P(n) = A000041(n) not already in the sequence.
%C Provided A046641(m) is defined for any number m > 0, this sequence is a permutation of the natural numbers.
%H Rémy Sigrist, <a href="/A307547/b307547.txt">Table of n, a(n) for n = 1..5000</a>
%H Rémy Sigrist, <a href="/A307547/a307547.gp.txt">PARI program for A307547</a>
%F a(A049575(k)) = A049575(k).
%e The first terms, alongside the divisors of P(n), are:
%e n a(n) div(P(n))
%e -- ---- --------------------
%e 1 1 (1)
%e 2 2 (1, 2)
%e 3 3 (1, 3)
%e 4 5 (1, 5)
%e 5 7 (1, 7)
%e 6 11 (1, 11)
%e 7 15 (1, 3, 5, 15)
%e 8 22 (1, 2, 11, 22)
%e 9 6 (1, 2, 3, 5, 6, 10, 15, 30)
%e 10 14 (1, 2, 3, 6, 7, 14, 21, 42)
%o (PARI) See Links section.
%Y Cf. A000041, A046641, A049575, A309200.
%K nonn
%O 1,2
%A _Rémy Sigrist_, Jul 27 2019
|
