Sequences
392,541 sequences
- LCM of exponents in prime factorization of n, a(1) = 1.A072411
LCM of exponents in prime factorization of n, a(1) = 1.
- Numbers k such that the LCM of exponents in the prime factorization of k does not equal the largest exponent.A072412
Numbers k such that the LCM of exponents in the prime factorization of k does not equal the largest exponent.
- Numbers k such that the LCM of exponents in the prime factorization of k does not equal the product of the exponents.A072413
Numbers k such that the LCM of exponents in the prime factorization of k does not equal the product of the exponents.
- Non-Achilles numbers for which LCM of the exponents in the prime factorization of n is not equal to the maximum of the same exponents.A072414
Non-Achilles numbers for which LCM of the exponents in the prime factorization of n is not equal to the maximum of the same exponents.
- a(1) = 2; a(n) = a(n-1)-th even nontotient number.A072415
a(1) = 2; a(n) = a(n-1)-th even nontotient number.
- a(1) = 2; a(n) = half of the a(n-1)-th even nontotient number.A072416
a(1) = 2; a(n) = half of the a(n-1)-th even nontotient number.
- a(n) = smallest positive m such that m! contains exactly n 0's, or 0 if no such m exists.A072417
a(n) = smallest positive m such that m! contains exactly n 0's, or 0 if no such m exists.
- Parity of floor(3^n/2^n).A072418
Parity of floor(3^n/2^n).
- Smallest factorial containing exactly n 0's, or 0 if no such factorial exists.A072419
Smallest factorial containing exactly n 0's, or 0 if no such factorial exists.
- Minimum number of steps needed to transform n into 153 where each step is either tripling or taking the sum of cubes of digits.A072420
Minimum number of steps needed to transform n into 153 where each step is either tripling or taking the sum of cubes of digits.
- The p-est sequence is similar to the Aronson sequence except that instead of the generating sentence beginning with T, it begins with P and instead of being in English it is in Latin.A072421
The p-est sequence is similar to the Aronson sequence except that instead of the generating sentence beginning with T, it begins with P and instead of being in English it is in Latin.
- The n-est sequence is similar to the Aronson sequence except that instead of the generating sentence beginning with T, it begins with N and instead of being in English it is in Latin.A072422
The n-est sequence is similar to the Aronson sequence except that instead of the generating sentence beginning with T, it begins with N and instead of being in English it is in Latin.
- The t-est sequence is similar to the Aronson sequence except that instead of being in English it is in Latin.A072423
The t-est sequence is similar to the Aronson sequence except that instead of being in English it is in Latin.
- The five's sequence merely counts the letters in the words of the generating sentence.A072424
The five's sequence merely counts the letters in the words of the generating sentence.
- The four-is sequence merely counts the letters in the words of the generating sentence.A072425
The four-is sequence merely counts the letters in the words of the generating sentence.
- Numbers whose Hebrew name begin with the letter "Shin".A072426
Numbers whose Hebrew name begin with the letter "Shin".
- Numbers n for which there is a unique k such that n = k + reverse(k).A072427
Numbers n for which there is a unique k such that n = k + reverse(k).
- Numbers n for which there are exactly four k such that n = k + reverse(k).A072428
Numbers n for which there are exactly four k such that n = k + reverse(k).
- Numbers n for which there are exactly five k such that n = k + reverse(k).A072429
Numbers n for which there are exactly five k such that n = k + reverse(k).
- Numbers n for which there are exactly six k such that n = k + reverse(k).A072430
Numbers n for which there are exactly six k such that n = k + reverse(k).
- Numbers n for which there are exactly seven k such that n = k + reverse(k).A072431
Numbers n for which there are exactly seven k such that n = k + reverse(k).
- Numbers n for which there are exactly eight k such that n = k + reverse(k).A072432
Numbers n for which there are exactly eight k such that n = k + reverse(k).
- Numbers n for which there are exactly nine k such that n = k + reverse(k).A072433
Numbers n for which there are exactly nine k such that n = k + reverse(k).
- Numbers n for which there are exactly ten k such that n = k + reverse(k).A072434
Numbers n for which there are exactly ten k such that n = k + reverse(k).
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).A072435
Numbers n for which there are exactly twelve k such that n = k + reverse(k).
- Remove prime factors of form 4*k+3.A072436
Remove prime factors of form 4*k+3.
- Numbers with no prime factors of form 4*k+3.A072437
Numbers with no prime factors of form 4*k+3.
- Remove prime factors of form 4*k+1.A072438
Remove prime factors of form 4*k+1.
- Primes prime(k) such that the number of binary 1's in prime(k) equals the number of binary 1's in k.A072439
Primes prime(k) such that the number of binary 1's in prime(k) equals the number of binary 1's in k.
- 3-smooth numbers k with decimal digits <= 3.A072440
3-smooth numbers k with decimal digits <= 3.
- Least k such that Sum_{i=1..k} sin(1/sqrt(i)) > n.A072441
Least k such that Sum_{i=1..k} sin(1/sqrt(i)) > n.
- Least k such that Sum_{i=1..k} cos(1/sqrt(i)) > n.A072442
Least k such that Sum_{i=1..k} cos(1/sqrt(i)) > n.
- Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).A072443
Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).
- Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.A072444
Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.
- Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; {1,2,...,n} is an element of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.A072445
Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; {1,2,...,n} is an element of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.
- Number of connectedness systems on n vertices that contain all singletons.A072446
Number of connectedness systems on n vertices that contain all singletons.
- Number of connectedness systems on n vertices that contain all singletons and the set of all the vertices.A072447
Number of connectedness systems on n vertices that contain all singletons and the set of all the vertices.
- Squares of the terms of the decimal expansion of Pi.A072448
Squares of the terms of the decimal expansion of Pi.
- Decimal expansion of the limit of the nested radical sqrt(1 + sqrt(2 + sqrt(3 + sqrt(4 + ... )))).A072449
Decimal expansion of the limit of the nested radical sqrt(1 + sqrt(2 + sqrt(3 + sqrt(4 + ... )))).
- Continued fraction expansion of the limit of a nested radical, sqrt(1 + sqrt(2 + sqrt(3 + sqrt(4 + ... )))).A072450
Continued fraction expansion of the limit of a nested radical, sqrt(1 + sqrt(2 + sqrt(3 + sqrt(4 + ... )))).
- Number of odd terms in the reduced residue system of 2*n-1.A072451
Number of odd terms in the reduced residue system of 2*n-1.
- a(n) = reversal(a(n-1)+n) for n>0, a(0) = 0.A072452
a(n) = reversal(a(n-1)+n) for n>0, a(0) = 0.
- Shadow transform of A000522.A072453
Shadow transform of A000522.
- Number of nontotients in the reduced residue system of 2n-1.A072454
Number of nontotients in the reduced residue system of 2n-1.
- Number of totients in the reduced residue system of 2n-1.A072455
Number of totients in the reduced residue system of 2n-1.
- Annihilating primes for A000522.A072456
Annihilating primes for A000522.
- Shadow transform of tetrahedral numbers A000292.A072457
Shadow transform of tetrahedral numbers A000292.
- Shadow transform of Catalan numbers A000108.A072458
Shadow transform of Catalan numbers A000108.
- Largest prime divisor of even nontotients.A072459
Largest prime divisor of even nontotients.
- Smallest even nontotient number whose largest prime divisor equals the n-th prime.A072460
Smallest even nontotient number whose largest prime divisor equals the n-th prime.