Sequences
392,541 sequences
- Number of primes less than 10^n with initial digit 7.A073511
Number of primes less than 10^n with initial digit 7.
- Number of primes less than 10^n with initial digit 6.A073512
Number of primes less than 10^n with initial digit 6.
- Number of primes less than 10^n with initial digit 5.A073513
Number of primes less than 10^n with initial digit 5.
- Number of primes less than 10^n with initial digit 4.A073514
Number of primes less than 10^n with initial digit 4.
- Number of primes less than 10^n with initial digit 3.A073515
Number of primes less than 10^n with initial digit 3.
- Number of primes less than 10^n with initial digit 2.A073516
Number of primes less than 10^n with initial digit 2.
- Number of primes less than 10^n with initial digit 1.A073517
Number of primes less than 10^n with initial digit 1.
- Cotangent of Pi/prime(n), rounded to nearest integer.A073518
Cotangent of Pi/prime(n), rounded to nearest integer.
- The set of nine consecutive primes forming a 3 X 3 magic square with the smallest magic constant (4440084513).A073519
The set of nine consecutive primes forming a 3 X 3 magic square with the smallest magic constant (4440084513).
- Smallest magic constant for any n X n magic square made from consecutive primes, or 0 if no such magic square exists.A073520
Smallest magic constant for any n X n magic square made from consecutive primes, or 0 if no such magic square exists.
- The set of 16 consecutive primes with the property that they form a 4 X 4 magic square with the smallest magic constant (258).A073521
The set of 16 consecutive primes with the property that they form a 4 X 4 magic square with the smallest magic constant (258).
- A set of 25 consecutive primes that form a 5 X 5 magic square with the (non-minimal) magic constant 1703.A073522
A set of 25 consecutive primes that form a 5 X 5 magic square with the (non-minimal) magic constant 1703.
- The set of 36 consecutive primes that form a 6 X 6 pandiagonal magic square with the smallest magic constant (930).A073523
The set of 36 consecutive primes that form a 6 X 6 pandiagonal magic square with the smallest magic constant (930).
- Number of steps to reach an integer starting with (n+1)/n and using the map x -> x*ceiling(x); or -1 if no integer is ever reached.A073524
Number of steps to reach an integer starting with (n+1)/n and using the map x -> x*ceiling(x); or -1 if no integer is ever reached.
- Result of applying the transformation on generating functions A -> 1/((1-x)*(1-x*A)) to the g.f. for A024718.A073525
Result of applying the transformation on generating functions A -> 1/((1-x)*(1-x*A)) to the g.f. for A024718.
- Denominator of Sum_{k=1..n} 1/k^2 is a square.A073526
Denominator of Sum_{k=1..n} 1/k^2 is a square.
- Numbers n such that denominator of Sum_{k=1..n} 1/k^2 is not a square.A073527
Numbers n such that denominator of Sum_{k=1..n} 1/k^2 is not a square.
- n at which A073524(n) sets a new record.A073528
n at which A073524(n) sets a new record.
- Record values in A073524.A073529
Record values in A073524.
- a(n) = (1/n)*Sum_{k=0..n} binomial(n, k)*binomial(n+k, k+1)*binomial(n+k, k) with a(0) = 1.A073530
a(n) = (1/n)*Sum_{k=0..n} binomial(n, k)*binomial(n+k, k+1)*binomial(n+k, k) with a(0) = 1.
- Number of n-digit positive integers with all digits distinct.A073531
Number of n-digit positive integers with all digits distinct.
- Number of n-digit primes with all digits distinct.A073532
Number of n-digit primes with all digits distinct.
- Let x(1)=1, x(n+1) = (4/3)*x(n) - floor((4/3)*x(n)); then a(n)=x(n)*3^n.A073533
Let x(1)=1, x(n+1) = (4/3)*x(n) - floor((4/3)*x(n)); then a(n)=x(n)*3^n.
- Numbers n such that S(n+2) = S(n)+2, where S(n) is the Kempner function A002034.A073534
Numbers n such that S(n+2) = S(n)+2, where S(n) is the Kempner function A002034.
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).A073535
Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).
- Breaking indices for A058842 (i.e., n such that A058842(n) is not equal to 3*A058842 (n-1) ).A073536
Breaking indices for A058842 (i.e., n such that A058842(n) is not equal to 3*A058842 (n-1) ).
- Rearrangement of cubes such that the sum of two consecutive terms + 1 is a prime.A073537
Rearrangement of cubes such that the sum of two consecutive terms + 1 is a prime.
- Let c(0)=n>=2 and c(k+1) = floor(3*c(k)/2); then a(n) is the smallest value such that c(a(n)) is prime.A073538
Let c(0)=n>=2 and c(k+1) = floor(3*c(k)/2); then a(n) is the smallest value such that c(a(n)) is prime.
- Numbers k such that if p is a prime dividing k then p divides phi(k).A073539
Numbers k such that if p is a prime dividing k then p divides phi(k).
- Composite numbers k such that k/phi(k) - sigma(k)/k has numerator equal to 1.A073540
Composite numbers k such that k/phi(k) - sigma(k)/k has numerator equal to 1.
- Numbers k such that 1/(1/sigma(k) + 1/sigma(k+1)) is an integer.A073541
Numbers k such that 1/(1/sigma(k) + 1/sigma(k+1)) is an integer.
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1)) is an integer.A073542
Numbers k such that 1/(1/phi(k) + 1/phi(k+1)) is an integer.
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2)) is an integer.A073543
Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2)) is an integer.
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.A073544
Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.
- Least k such that 1/tau(k) + 1/tau(k+1) + 1/tau(k+2) + ... + 1/tau(k+n) is equal to 1 (where tau(k)=A000005(k) is the number of divisors of k).A073545
Least k such that 1/tau(k) + 1/tau(k+1) + 1/tau(k+2) + ... + 1/tau(k+n) is equal to 1 (where tau(k)=A000005(k) is the number of divisors of k).
- Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the largest denominator is smallest possible.A073546
Triangle read by rows: row n gives denominators of n distinct unit fractions (or Egyptian fractions) summing to 1, where denominators are listed in increasing order and the largest denominator is smallest possible.
- Numbers k such that antid(k) = antid(k+1), where antid(k) = A066272(k).A073547
Numbers k such that antid(k) = antid(k+1), where antid(k) = A066272(k).
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 2.A073548
Number of Fibonacci numbers F(k), k <= 10^n, which end in 2.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 6.A073549
Number of Fibonacci numbers F(k), k <= 10^n, which end in 6.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 1.A073550
Number of Fibonacci numbers F(k), k <= 10^n, which end in 1.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 3.A073551
Number of Fibonacci numbers F(k), k <= 10^n, which end in 3.
- Duplicate of A067275.A073552
Duplicate of A067275.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 5.A073553
Number of Fibonacci numbers F(k), k <= 10^n, which end in 5.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 7.A073554
Number of Fibonacci numbers F(k), k <= 10^n, which end in 7.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 8.A073555
Number of Fibonacci numbers F(k), k <= 10^n, which end in 8.
- Number of Fibonacci numbers F(k), k <= 10^n, which end in 9.A073556
Number of Fibonacci numbers F(k), k <= 10^n, which end in 9.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 1.A073557
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 1.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 2.A073558
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 2.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 3.A073559
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 3.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 4.A073560
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 4.