This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A282141 a(n)=least number strictly greater than n with an equivalent prime tower factorization. 1
 3, 5, 27, 7, 10, 11, 9, 25, 14, 13, 20, 17, 15, 21, 7625597484987, 19, 24, 23, 28, 22, 26, 29, 50, 32, 33, 3125, 44, 31, 42, 37, 49, 34, 35, 38, 100, 41, 39, 46, 45, 43, 66, 47, 52, 56, 51, 53, 80, 121, 98, 55, 54, 59, 68, 57, 63, 58, 62, 61, 84, 67, 65, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS The prime tower factorization of a number is defined in A182318. The prime tower factorization equivalence classes are described in A279686. For any n>1, a(n)=least k>n such that A279690(n)=A279690(k). This sequence is a permutation of the complement of A279686. This sequence is to prime tower factorization what A081761 is to prime signature. LINKS Rémy Sigrist, Table of n, a(n) for n = 2..2500 Rémy Sigrist, Illustration of the first terms FORMULA a(A000040(n)) = A000040(n+1) for any n>0. a(A006881(n)) = A006881(n+1) for any n>0. a(A051674(n)) = A051674(n+1) for any n>0. a(A007304(n)) = A007304(n+1) for any n>0. a(A046386(n)) = A046386(n+1) for any n>0. a(A046387(n)) = A046387(n+1) for any n>0. a(A067885(n)) = A067885(n+1) for any n>0. PROG (PARI) a(n) = my (c=a279690(n)); my (k=n+1); while (c!=a279690(k), k++); k CROSSREFS Cf. A000040, A006881, A007304, A046386, A046387, A051674, A067885, A081761, A182318, A279686, A279690 Sequence in context: A101611 A268409 A182030 * A318321 A279510 A301315 Adjacent sequences:  A282138 A282139 A282140 * A282142 A282143 A282144 KEYWORD nonn AUTHOR Rémy Sigrist, Feb 07 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 15 20:47 EST 2019. Contains 319184 sequences. (Running on oeis4.)