Sequences
392,541 sequences
- Radii n of circles with integer radius that can approximately be squared integrally: the floor or ceiling of Pi*n^2 is an integer square.A067561
Radii n of circles with integer radius that can approximately be squared integrally: the floor or ceiling of Pi*n^2 is an integer square.
- Odd values of k such that phi(k)! divides phi(k!) where phi(k) = A000010(k).A067562
Odd values of k such that phi(k)! divides phi(k!) where phi(k) = A000010(k).
- Product of n-th prime number and n-th composite number.A067563
Product of n-th prime number and n-th composite number.
- Numbers n such that determinant[{{n, phi(n), sigma(n)}, {n+1, phi(n+1), sigma(n+1)}, {n+2, phi(n+2), sigma(n+2)}}] is a nonnegative cube.A067564
Numbers n such that determinant[{{n, phi(n), sigma(n)}, {n+1, phi(n+1), sigma(n+1)}, {n+2, phi(n+2), sigma(n+2)}}] is a nonnegative cube.
- Inverse of R. L. Graham's sequence (A006255), or zero if and only if n is a prime.A067565
Inverse of R. L. Graham's sequence (A006255), or zero if and only if n is a prime.
- Smallest k such that k = n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e., Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.A067566
Smallest k such that k = n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e., Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.
- Odd numbers with an odd number of partitions.A067567
Odd numbers with an odd number of partitions.
- Numbers n such that A000009(n) divides A022629(n).A067568
Numbers n such that A000009(n) divides A022629(n).
- Numbers n such that A000041(n) divides A006906(n).A067569
Numbers n such that A000041(n) divides A006906(n).
- Numbers n such that A000009(n) divides A067553(n).A067570
Numbers n such that A000009(n) divides A067553(n).
- Numbers n such that determinant[{{n,phi(n)},{n+1,phi(n+1)}}]is a perfect square.A067571
Numbers n such that determinant[{{n,phi(n)},{n+1,phi(n+1)}}]is a perfect square.
- Numbers n such that determinant[{{n, sigma(n)}, {n+1, sigma(n+1)}}] is a perfect square.A067572
Numbers n such that determinant[{{n, sigma(n)}, {n+1, sigma(n+1)}}] is a perfect square.
- Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.A067573
Numbers k > 1 such that sigma(phi(k))/sigma(k) > sigma(phi(j))/sigma(j) for all 1 < j < k.
- Array T(i,j) read by ascending antidiagonals, where T(i,j) is the concatenation of i and j (1<=i, 1<=j).A067574
Array T(i,j) read by ascending antidiagonals, where T(i,j) is the concatenation of i and j (1<=i, 1<=j).
- Numbers k that divide phi(k)*bigomega(k).A067575
Numbers k that divide phi(k)*bigomega(k).
- Array T(i,j) read by downward antidiagonals, where T(i,j) is the j-th term whose binary expansion has i 1's.A067576
Array T(i,j) read by downward antidiagonals, where T(i,j) is the j-th term whose binary expansion has i 1's.
- a(n) = Product_{i=1..n} sigma(i) * Sum_{i=1..n} 1/sigma(i).A067577
a(n) = Product_{i=1..n} sigma(i) * Sum_{i=1..n} 1/sigma(i).
- a(n) = Product_{i=1..n} phi(i) * Sum_{i=1..n} 1/phi(i) where phi is the Euler totient function A000010(n).A067578
a(n) = Product_{i=1..n} phi(i) * Sum_{i=1..n} 1/phi(i) where phi is the Euler totient function A000010(n).
- Conjectured values of a(n) defined by: a(n) = first prime appearing in the orbit n, f(n), f(f(n)),...., if it exists; = 0 otherwise, where f(n) = n + sigma(n).A067579
Conjectured values of a(n) defined by: a(n) = first prime appearing in the orbit n, f(n), f(f(n)),...., if it exists; = 0 otherwise, where f(n) = n + sigma(n).
- a(n) = Product_{i=2..n} A001222(i) * Sum_{i=2..n} 1/A001222(i).A067580
a(n) = Product_{i=2..n} A001222(i) * Sum_{i=2..n} 1/A001222(i).
- a(n) = smallest integer not yet in the sequence with no digits in common with a(n-1), a(0)=0.A067581
a(n) = smallest integer not yet in the sequence with no digits in common with a(n-1), a(0)=0.
- Nonprime values of n such that bigomega(n)^omega(n)=omega(n)^bigomega(n) where bigomega(n) is the number of prime factors of n (counted with multiplicity) and omega(n) the number of distinct prime factors of n.A067582
Nonprime values of n such that bigomega(n)^omega(n)=omega(n)^bigomega(n) where bigomega(n) is the number of prime factors of n (counted with multiplicity) and omega(n) the number of distinct prime factors of n.
- Integers of the form phi(n^n)/phi(n)^n where phi is the Euler totient function A000010(n).A067583
Integers of the form phi(n^n)/phi(n)^n where phi is the Euler totient function A000010(n).
- Product of divisors of n-th perfect number.A067584
Product of divisors of n-th perfect number.
- Binary representation of a(n) is obtained thus: replace every digit in the binary representation of n with "1" if the sum of its neighbors is 1 and with "0" otherwise.A067585
Binary representation of a(n) is obtained thus: replace every digit in the binary representation of n with "1" if the sum of its neighbors is 1 and with "0" otherwise.
- Number of 0's in the binary expansion of A066884(n+1).A067586
Number of 0's in the binary expansion of A066884(n+1).
- Inverse of A066884 considered as a permutation of the positive integers.A067587
Inverse of A066884 considered as a permutation of the positive integers.
- Total number of parts in all partitions of n into odd parts.A067588
Total number of parts in all partitions of n into odd parts.
- Numbers k such that A067588(k) is an odd number.A067589
Numbers k such that A067588(k) is an odd number.
- Number of partitions of n into odious numbers (A000069).A067590
Number of partitions of n into odious numbers (A000069).
- Number of partitions of n into evil numbers (A001969).A067591
Number of partitions of n into evil numbers (A001969).
- Number of partitions of n into Lucas parts (A000204(k) for k >= 1).A067592
Number of partitions of n into Lucas parts (A000204(k) for k >= 1).
- Number of partitions of n into Lucas parts (A000032).A067593
Number of partitions of n into Lucas parts (A000032).
- Number of partitions of n into distinct lucky parts (A000959).A067594
Number of partitions of n into distinct lucky parts (A000959).
- Number of partitions of n into distinct Lucas parts (A000032).A067595
Number of partitions of n into distinct Lucas parts (A000032).
- Number of partitions of n into palindrome parts in base 2.A067596
Number of partitions of n into palindrome parts in base 2.
- Number of partitions of n into distinct palindrome parts in base 2.A067597
Number of partitions of n into distinct palindrome parts in base 2.
- Decimal encoding of the prime factorization of n is a multiple of n.A067598
Decimal encoding of the prime factorization of n is a multiple of n.
- Decimal encoding of the prime factorization of n: concatenation of prime factors and exponents.A067599
Decimal encoding of the prime factorization of n: concatenation of prime factors and exponents.
- Numbers n such that f(n) and f(f(n)) are prime, where f(k) = decimal encoding of the prime factorization of k.A067600
Numbers n such that f(n) and f(f(n)) are prime, where f(k) = decimal encoding of the prime factorization of k.
- a(n) is the number of inequivalent permutations of {0..2n-1}, such that the first differences (modulo 2n) are a permutation of {1..2n-1}.A067601
a(n) is the number of inequivalent permutations of {0..2n-1}, such that the first differences (modulo 2n) are a permutation of {1..2n-1}.
- 5^n reduced modulo 3^n.A067602
5^n reduced modulo 3^n.
- Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.A067603
Least k such that gcd(prime(k)+1, prime(k+1)+1) = 2n.
- Smallest prime p of two consecutive primes, p < q, such that gcd(p+1, q+1) = 2n.A067604
Smallest prime p of two consecutive primes, p < q, such that gcd(p+1, q+1) = 2n.
- Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.A067605
Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.
- Primes p such that p+7 == 0 (mod phi(p+7)).A067606
Primes p such that p+7 == 0 (mod phi(p+7)).
- Number of stacks of n pancakes requiring a maximum number of flips to order.A067607
Number of stacks of n pancakes requiring a maximum number of flips to order.
- Number of structural alkanes with combinatorial diameter n.A067608
Number of structural alkanes with combinatorial diameter n.
- Number of stereo alkanes with combinatorial diameter n.A067609
Number of stereo alkanes with combinatorial diameter n.
- Number of stereo alkanes not containing a certain forbidden substructure with combinatorial diameter n.A067610
Number of stereo alkanes not containing a certain forbidden substructure with combinatorial diameter n.