Sequences
392,541 sequences
- Composition of the A059905 and A048679, i.e., a(n) = A059905(A048679(n)).A072661
Composition of the A059905 and A048679, i.e., a(n) = A059905(A048679(n)).
- Composition of the A059906 and A048679, i.e., a(n) = A059906(A048679(n)).A072662
Composition of the A059906 and A048679, i.e., a(n) = A059906(A048679(n)).
- Numbers m such that Sum_{k=1..m} (-1)^k*k*floor(m/k) = 0.A072663
Numbers m such that Sum_{k=1..m} (-1)^k*k*floor(m/k) = 0.
- End of smallest run of n consecutive integers with n, n-1, ..., 1 distinct prime factors in that order.A072664
End of smallest run of n consecutive integers with n, n-1, ..., 1 distinct prime factors in that order.
- Center of smallest run of 2n+1 consecutive numbers with exactly n+1,n,...,2,1,2,...,n,n+1 distinct prime factors, respectively.A072665
Center of smallest run of 2n+1 consecutive numbers with exactly n+1,n,...,2,1,2,...,n,n+1 distinct prime factors, respectively.
- Numbers n such that prime(n) + prime(n+1) - 1 is prime.A072666
Numbers n such that prime(n) + prime(n+1) - 1 is prime.
- Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives values of prime(m).A072667
Consider m such that prime(m) + prime(m+1) = prime(k) + 1 for some k; sequence gives values of prime(m).
- Numbers one less than composite numbers.A072668
Numbers one less than composite numbers.
- Primes of the form prime(x) + prime(x+1) - 1.A072669
Primes of the form prime(x) + prime(x+1) - 1.
- Number of ways to write n as i*j + i + j, 0 < i <= j.A072670
Number of ways to write n as i*j + i + j, 0 < i <= j.
- Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.A072671
Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.
- Prime(n)*prime(2*n)+prime(n)+prime(2*n).A072672
Prime(n)*prime(2*n)+prime(n)+prime(2*n).
- Primes of form prime(n)*prime(2*n)+prime(n)+prime(2*n).A072673
Primes of form prime(n)*prime(2*n)+prime(n)+prime(2*n).
- a(n) = 3^n+2*2^n-3.A072674
a(n) = 3^n+2*2^n-3.
- Integers m such that the last digit of Fibonacci(m) is 1.A072675
Integers m such that the last digit of Fibonacci(m) is 1.
- Numbers k for which the prime circle problem has a solution composed of disjoint subsets: the arrangement of numbers 1 through 2k around a circle is such that the sum of each pair of adjacent numbers is prime, the odd numbers are in order and the even numbers are in groups of decreasing sequences.A072676
Numbers k for which the prime circle problem has a solution composed of disjoint subsets: the arrangement of numbers 1 through 2k around a circle is such that the sum of each pair of adjacent numbers is prime, the odd numbers are in order and the even numbers are in groups of decreasing sequences.
- a(n) = prime(prime(n)+1) where prime(k) is the k-th prime.A072677
a(n) = prime(prime(n)+1) where prime(k) is the k-th prime.
- Generalized Bell numbers B_{4,2}.A072678
Generalized Bell numbers B_{4,2}.
- a(n) = (3*(n-1)+3)! *(3*(n-1)+6)! *2F2(3*n+1,3*n+4; 4,7; 1)/( 3! *6! *exp(1)), where 2F2(;;) is the generalized hypergeometric series.A072679
a(n) = (3*(n-1)+3)! *(3*(n-1)+6)! *2F2(3*n+1,3*n+4; 4,7; 1)/( 3! *6! *exp(1)), where 2F2(;;) is the generalized hypergeometric series.
- Difference between (least prime >= n) and (largest prime <= n).A072680
Difference between (least prime >= n) and (largest prime <= n).
- a(n) = (n - A007917(n)) * (A007918(n) - n).A072681
a(n) = (n - A007917(n)) * (A007918(n) - n).
- Numbers congruent to {3, 36, 54, 57} mod 60.A072682
Numbers congruent to {3, 36, 54, 57} mod 60.
- Numbers k such that the last digit of F(k) is 3 where F(k) is the k-th Fibonacci number.A072683
Numbers k such that the last digit of F(k) is 3 where F(k) is the k-th Fibonacci number.
- Expansion of (2+x+3*x^2+2*x^3+x^4)/(1-x-5*x^2+x^3+3*x^4-x^5).A072684
Expansion of (2+x+3*x^2+2*x^3+x^4)/(1-x-5*x^2+x^3+3*x^4-x^5).
- Positive integers whose English names contain a prime number of letters.A072685
Positive integers whose English names contain a prime number of letters.
- Prime numbers whose (British) English names have a prime number of letters.A072686
Prime numbers whose (British) English names have a prime number of letters.
- Number of primes with prime length names in range 1 -> 10^n.A072687
Number of primes with prime length names in range 1 -> 10^n.
- Of the first n integers (inclusive), how many of them have a prime number of letters in their English names?A072688
Of the first n integers (inclusive), how many of them have a prime number of letters in their English names?
- Difference between (least square >= n) and (largest square <= n).A072689
Difference between (least square >= n) and (largest square <= n).
- a(n) = (n - A048760(n)) * (A048761(n) - n).A072690
a(n) = (n - A048760(n)) * (A048761(n) - n).
- Decimal expansion of Pi^2/12.A072691
Decimal expansion of Pi^2/12.
- Sum of sigma(j) for 1<=j<=10^n, where sigma(j) is the sum of the divisors of j.A072692
Sum of sigma(j) for 1<=j<=10^n, where sigma(j) is the sum of the divisors of j.
- Special values of confluent hypergeometric function 1F1: a(n)=(5*n)!*hypergeom([5*n+1],[6],1)/(5!*exp(1)).A072693
Special values of confluent hypergeometric function 1F1: a(n)=(5*n)!*hypergeom([5*n+1],[6],1)/(5!*exp(1)).
- (p(n)#)^p(n), or n-th primorial raised to n-th prime power.A072694
(p(n)#)^p(n), or n-th primorial raised to n-th prime power.
- a(n) = lcm(d(n^2),d(n)), where d(n) = A000005, the number of divisors of n.A072695
a(n) = lcm(d(n^2),d(n)), where d(n) = A000005, the number of divisors of n.
- a(n) = lcm(d(n^3), d(n)), where d(n) = A000005, the number of divisors of n.A072696
a(n) = lcm(d(n^3), d(n)), where d(n) = A000005, the number of divisors of n.
- Squarefree numbers such that the sum of the prime factors is a multiple of the number of prime factors.A072697
Squarefree numbers such that the sum of the prime factors is a multiple of the number of prime factors.
- Sum of prime factors of A072697(n).A072698
Sum of prime factors of A072697(n).
- Number of prime factors of A072697(n).A072699
Number of prime factors of A072697(n).
- A072698(n) / A072699(n).A072700
A072698(n) / A072699(n).
- Number of ways to write n as the arithmetic mean of a set of distinct primes.A072701
Number of ways to write n as the arithmetic mean of a set of distinct primes.
- Last digit of F(n) is 4 where F(n) is the n-th Fibonacci number.A072702
Last digit of F(n) is 4 where F(n) is the n-th Fibonacci number.
- Indices of Fibonacci numbers whose last digit is 5.A072703
Indices of Fibonacci numbers whose last digit is 5.
- Triangle of number of weakly unimodal partitions/compositions of n into exactly k terms.A072704
Triangle of number of weakly unimodal partitions/compositions of n into exactly k terms.
- Triangle of number of unimodal compositions of n into exactly k distinct terms.A072705
Triangle of number of unimodal compositions of n into exactly k distinct terms.
- Number of unimodal partitions/compositions of n into distinct terms.A072706
Number of unimodal partitions/compositions of n into distinct terms.
- Number of non-unimodal compositions of n into distinct terms.A072707
Number of non-unimodal compositions of n into distinct terms.
- Last digit of F(n) is 6 where F(n) is the n-th Fibonacci number.A072708
Last digit of F(n) is 6 where F(n) is the n-th Fibonacci number.
- Integers m such that the last digit of Fibonacci(m) is 7.A072709
Integers m such that the last digit of Fibonacci(m) is 7.
- Last digit of F(n) is 8 where F(n) is the n-th Fibonacci number.A072710
Last digit of F(n) is 8 where F(n) is the n-th Fibonacci number.