Sequences
392,541 sequences
- Powers of 7 with digit sum divisible by 7.A067511
Powers of 7 with digit sum divisible by 7.
- Duplicate of A067505.A067512
Duplicate of A067505.
- Number of divisors d of n such that d+1 is prime.A067513
Number of divisors d of n such that d+1 is prime.
- Number of distinct primes of the form floor(n/k) for 1 <= k <= n.A067514
Number of distinct primes of the form floor(n/k) for 1 <= k <= n.
- Fibonacci numbers with index = digit sum.A067515
Fibonacci numbers with index = digit sum.
- Fibonacci numbers starting with a different Fibonacci number of at least two digits.A067516
Fibonacci numbers starting with a different Fibonacci number of at least two digits.
- Fibonacci numbers which can be partitioned into groups of digits which are Fibonacci numbers.A067517
Fibonacci numbers which can be partitioned into groups of digits which are Fibonacci numbers.
- Number of spanning trees in n X n X 2 grid.A067518
Number of spanning trees in n X n X 2 grid.
- Numbers k such that k^2 + 1 is composite and phi(k^2 + 1) == 0 (mod k).A067519
Numbers k such that k^2 + 1 is composite and phi(k^2 + 1) == 0 (mod k).
- Triangular numbers whose index is a multiple of the sum of their digits.A067520
Triangular numbers whose index is a multiple of the sum of their digits.
- Numbers n such that the square root of n is an integer and a multiple of the sum of the digits of n.A067521
Numbers n such that the square root of n is an integer and a multiple of the sum of the digits of n.
- Smallest prime with sum of digits = 2^n.A067522
Smallest prime with sum of digits = 2^n.
- The smallest prime with a possible given digit sum.A067523
The smallest prime with a possible given digit sum.
- Smallest composite number with digit sum n.A067524
Smallest composite number with digit sum n.
- Define I(n) = number obtained by incrementing each digit from 0 to 8 of n by 1. A '9' is replaced by a '0'. Sequence gives digitriangular numbers n*I(n)/2.A067525
Define I(n) = number obtained by incrementing each digit from 0 to 8 of n by 1. A '9' is replaced by a '0'. Sequence gives digitriangular numbers n*I(n)/2.
- Numbers n such that n - 2^k is a prime or 1 for all k satisfying 0 < k, 2^k < n.A067526
Numbers n such that n - 2^k is a prime or 1 for all k satisfying 0 < k, 2^k < n.
- n - 3^k is a prime for all k > 0 such that 3^k < n.A067527
n - 3^k is a prime for all k > 0 such that 3^k < n.
- Numbers n such that n - 4^k is a prime or 1 for all k > 0 and n > 4^k.A067528
Numbers n such that n - 4^k is a prime or 1 for all k > 0 and n > 4^k.
- n - 5^k is a prime for all k > 0 and n > 5^k.A067529
n - 5^k is a prime for all k > 0 and n > 5^k.
- Numbers k such that k - m! is a prime or 1 for all m > 1 and k > m!.A067530
Numbers k such that k - m! is a prime or 1 for all m > 1 and k > m!.
- Numbers n such that n - number of divisors of n is a prime.A067531
Numbers n such that n - number of divisors of n is a prime.
- Numbers k such that k + number of divisors of k is a prime.A067532
Numbers k such that k + number of divisors of k is a prime.
- Numbers k such that both k - tau(k) and k + tau(k) are prime where tau(k) = A000005(k).A067533
Numbers k such that both k - tau(k) and k + tau(k) are prime where tau(k) = A000005(k).
- a(n) = 4^n * Sum_{i=1..n} i^4/4^i.A067534
a(n) = 4^n * Sum_{i=1..n} i^4/4^i.
- Smallest squarefree number >= n.A067535
Smallest squarefree number >= n.
- Numbers k such that phi(k*(k+1)*(k+2)/3)/phi(k) is not an integer where phi(k) is the Euler totient function A000010(k).A067536
Numbers k such that phi(k*(k+1)*(k+2)/3)/phi(k) is not an integer where phi(k) is the Euler totient function A000010(k).
- Duplicate of A046339.A067537
Duplicate of A046339.
- Number of partitions of n in which the number of parts divides n.A067538
Number of partitions of n in which the number of parts divides n.
- Number of partitions of n in which, if the number of parts is k, the product of the parts is the k-th power of some positive integer.A067539
Number of partitions of n in which, if the number of parts is k, the product of the parts is the k-th power of some positive integer.
- Number of partitions of n in which the sum of reciprocal of parts divides number of parts.A067540
Number of partitions of n in which the sum of reciprocal of parts divides number of parts.
- a(n) = phi(n*(n+1)/2)/phi(n) where phi is the Euler totient function A000010(n).A067541
a(n) = phi(n*(n+1)/2)/phi(n) where phi is the Euler totient function A000010(n).
- Primes p such that p+5==0 (mod phi(p+5)).A067542
Primes p such that p+5==0 (mod phi(p+5)).
- Numbers k such that phi(k*(k+1)*(k+2)*(k+3)/4!)/phi(k*(k+1)*(k+2)/3!) is not an integer where phi(n) = A000010(n) is the Euler totient function.A067543
Numbers k such that phi(k*(k+1)*(k+2)*(k+3)/4!)/phi(k*(k+1)*(k+2)/3!) is not an integer where phi(n) = A000010(n) is the Euler totient function.
- Numbers k such that phi(k*(k+1)*(k+2)/6)/phi(k*(k+1)/2) is not an integer where phi(k) = A000010(k) is the Euler totient function.A067544
Numbers k such that phi(k*(k+1)*(k+2)/6)/phi(k*(k+1)/2) is not an integer where phi(k) = A000010(k) is the Euler totient function.
- Determinant of an n X n matrix whose diagonal are the first n composite numbers and all other elements are 1's.A067545
Determinant of an n X n matrix whose diagonal are the first n composite numbers and all other elements are 1's.
- Determinant of an n X n matrix whose diagonal are the first n nonprime numbers and all other elements are 1's.A067546
Determinant of an n X n matrix whose diagonal are the first n nonprime numbers and all other elements are 1's.
- Number of divisors of n equals the average of distinct prime factors of n.A067547
Number of divisors of n equals the average of distinct prime factors of n.
- Least k > n such that gcd(prime(n)+k, n+prime(k)) > 1.A067548
Least k > n such that gcd(prime(n)+k, n+prime(k)) > 1.
- Determinant of n X n matrix whose diagonal are the first n primes and all other elements are 1's.A067549
Determinant of n X n matrix whose diagonal are the first n primes and all other elements are 1's.
- a(n) = (n-1)!(n+2)!/(3*2^n).A067550
a(n) = (n-1)!(n+2)!/(3*2^n).
- Determinant of an n X n matrix whose diagonal are the first n Primes of alternating sign and all other elements are 1's.A067551
Determinant of an n X n matrix whose diagonal are the first n Primes of alternating sign and all other elements are 1's.
- a(n) = SumOfDigits(n)^2 - SumOfDigits(n^2), where SumOfDigits = A007953.A067552
a(n) = SumOfDigits(n)^2 - SumOfDigits(n^2), where SumOfDigits = A007953.
- Sum of products of terms in all partitions of n into odd parts.A067553
Sum of products of terms in all partitions of n into odd parts.
- Number of partitions of n in which the product of parts is a power of n.A067554
Number of partitions of n in which the product of parts is a power of n.
- Smallest number m>1 such that the product of the parts in some partition of m is equal to m^n.A067555
Smallest number m>1 such that the product of the parts in some partition of m is equal to m^n.
- Terms in the decimal expansion of 1/(7*2^n) before the block of decimals 142857 (the period of 1/7) appears.A067556
Terms in the decimal expansion of 1/(7*2^n) before the block of decimals 142857 (the period of 1/7) appears.
- Primes p such that p-5 == 0 (mod phi(p-5)).A067557
Primes p such that p-5 == 0 (mod phi(p-5)).
- Sum of squares of proper divisors of n.A067558
Sum of squares of proper divisors of n.
- Numbers n such that floor(Pi*n^2) is prime.A067559
Numbers n such that floor(Pi*n^2) is prime.
- Determinant of n X n matrix whose rows are cyclic permutations of 1..n-th nonprime (A018252).A067560
Determinant of n X n matrix whose rows are cyclic permutations of 1..n-th nonprime (A018252).