login
a(n) = k such that A361321(k) = A000469(n), or -1 if A000469(n) never appears in A361321.
2

%I #8 Mar 11 2023 23:06:15

%S 1,2,3,8,11,5,7,15,24,6,18,4,19,10,14,30,21,12,20,34,38,16,33,25,23,

%T 42,13,37,48,17,53,45,9,50,58,28,83,36,61,29,55,79,40,62,22,65,49,54,

%U 66,27,69,41,59,70,32,35,73,47,39,74,60,26,44,87,78,93,63,98,52,64,43,101,77,86,102

%N a(n) = k such that A361321(k) = A000469(n), or -1 if A000469(n) never appears in A361321.

%C Conjectured to be a permutation of the natural numbers (and if so, -1 will never appear).

%H Scott R. Shannon, <a href="/A361324/b361324.txt">Table of n, a(n) for n = 1..10000</a>.

%Y Cf. A361321, A000469, A361323, A336957, A360519, A361102.

%K nonn

%O 1,2

%A _Scott R. Shannon_, _Rémy Sigrist_, and _N. J. A. Sloane_, Mar 11 2023