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