|
%I #13 Feb 10 2017 16:37:57
%S 3,5,27,7,10,11,9,25,14,13,20,17,15,21,7625597484987,19,24,23,28,22,
%T 26,29,50,32,33,3125,44,31,42,37,49,34,35,38,100,41,39,46,45,43,66,47,
%U 52,56,51,53,80,121,98,55,54,59,68,57,63,58,62,61,84,67,65,75
%N a(n)=least number strictly greater than n with an equivalent prime tower factorization.
%C The prime tower factorization of a number is defined in A182318.
%C The prime tower factorization equivalence classes are described in A279686.
%C For any n>1, a(n)=least k>n such that A279690(n)=A279690(k).
%C This sequence is a permutation of the complement of A279686.
%C This sequence is to prime tower factorization what A081761 is to prime signature.
%H Rémy Sigrist, <a href="/A282141/b282141.txt">Table of n, a(n) for n = 2..2500</a>
%H Rémy Sigrist, <a href="/A282141/a282141.pdf">Illustration of the first terms</a>
%F a(A000040(n)) = A000040(n+1) for any n>0.
%F a(A006881(n)) = A006881(n+1) for any n>0.
%F a(A051674(n)) = A051674(n+1) for any n>0.
%F a(A007304(n)) = A007304(n+1) for any n>0.
%F a(A046386(n)) = A046386(n+1) for any n>0.
%F a(A046387(n)) = A046387(n+1) for any n>0.
%F a(A067885(n)) = A067885(n+1) for any n>0.
%o (PARI) a(n) = my (c=a279690(n)); my (k=n+1); while (c!=a279690(k), k++); k
%Y Cf. A000040, A006881, A007304, A046386, A046387, A051674, A067885, A081761, A182318, A279686, A279690
%K nonn
%O 2,1
%A _Rémy Sigrist_, Feb 07 2017
|
