Sequences
392,541 sequences
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 5.A073561
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 5.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 6.A073562
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 6.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 7.A073563
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 7.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 8.A073564
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 8.
- Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 9.A073565
Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 9.
- Numbers n such that n, n+1 and n+2 have the same number of anti-divisors.A073566
Numbers n such that n, n+1 and n+2 have the same number of anti-divisors.
- Numbers k such that sigma(k) = phi(k)*omega(k).A073567
Numbers k such that sigma(k) = phi(k)*omega(k).
- Number of anti-divisors of n divides the number of divisors of n.A073568
Number of anti-divisors of n divides the number of divisors of n.
- Numbers k such that A002034(k) = A066272(k).A073569
Numbers k such that A002034(k) = A066272(k).
- G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.A073570
G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.
- Irreducible trinomials: numbers n such that x^n + x^k + 1 is an irreducible polynomial (mod 2) for some k with 0 < k < n.A073571
Irreducible trinomials: numbers n such that x^n + x^k + 1 is an irreducible polynomial (mod 2) for some k with 0 < k < n.
- Largest k such that the arithmetic mean of phi(n),phi(n+1),....,phi(n+x) is an integer for any x 0<=x<=k.A073572
Largest k such that the arithmetic mean of phi(n),phi(n+1),....,phi(n+x) is an integer for any x 0<=x<=k.
- Numbers n such that n^3 + 4 is prime.A073573
Numbers n such that n^3 + 4 is prime.
- Numbers n such that n^3 + 6 is prime.A073574
Numbers n such that n^3 + 6 is prime.
- Sum of factorial numbers dividing n.A073575
Sum of factorial numbers dividing n.
- Number of partitions of n into squarefree parts.A073576
Number of partitions of n into squarefree parts.
- a(n) = 4*n^2 + 4*n - 1.A073577
a(n) = 4*n^2 + 4*n - 1.
- a(n) = Sum_{k=1..n} mu(2*k).A073578
a(n) = Sum_{k=1..n} mu(2*k).
- Signed primes: if prime(n) even, a(n) = 0; if prime(n) == 1 (mod 4), a(n) = prime(n); if prime(n) == -1 (mod 4), a(n) = -prime(n).A073579
Signed primes: if prime(n) even, a(n) = 0; if prime(n) == 1 (mod 4), a(n) = prime(n); if prime(n) == -1 (mod 4), a(n) = -prime(n).
- Rearrangement of Fibonacci numbers such that the sum of two consecutive terms + 1 is a prime.A073580
Rearrangement of Fibonacci numbers such that the sum of two consecutive terms + 1 is a prime.
- Factorials successively exponentiated.A073581
Factorials successively exponentiated.
- Numbers k such that S(k) = k/2, where S(k) is the Kempner function A002034.A073582
Numbers k such that S(k) = k/2, where S(k) is the Kempner function A002034.
- Decimal expansion of 23/19.A073583
Decimal expansion of 23/19.
- Commuting even permutations: number of ordered pairs g, h in the alternating group A_n such that gh = hg.A073584
Commuting even permutations: number of ordered pairs g, h in the alternating group A_n such that gh = hg.
- Square root of n has the same nonzero digit in each of the first 4 places to the right of the decimal point.A073585
Square root of n has the same nonzero digit in each of the first 4 places to the right of the decimal point.
- Composite numbers k such that (k+1)*sigma(k) is a perfect square.A073586
Composite numbers k such that (k+1)*sigma(k) is a perfect square.
- a(n) = a(n-1)*2^n + 1 where a(0)=1.A073587
a(n) = a(n-1)*2^n + 1 where a(0)=1.
- a(n) = a(n-1)*2^n-1 with a(1)=1.A073588
a(n) = a(n-1)*2^n-1 with a(1)=1.
- a(n)=a(n-1)^2*2^n-1 where a(0)=1.A073589
a(n)=a(n-1)^2*2^n-1 where a(0)=1.
- Expansion of e.g.f. exp(x) * log(1+x)/(1-x).A073590
Expansion of e.g.f. exp(x) * log(1+x)/(1-x).
- a(n) = A000522(n) + 1.A073591
a(n) = A000522(n) + 1.
- Euler transform of negative integers.A073592
Euler transform of negative integers.
- Number of cards needed to be drawn (with replacement) from a deck of n cards to have a 50% or greater chance of seeing each card at least once.A073593
Number of cards needed to be drawn (with replacement) from a deck of n cards to have a 50% or greater chance of seeing each card at least once.
- Numerator of b(n) = Sum_{k=1..n} (-1)^(k+1)/k*Sum_{i=0..k-1} (-1)^i/(2*i+1).A073594
Numerator of b(n) = Sum_{k=1..n} (-1)^(k+1)/k*Sum_{i=0..k-1} (-1)^i/(2*i+1).
- Denominator of b(n) = Sum_{k=1..n} (-1)^(k+1)/k*Sum_{i=0..k-1} (-1)^i/(2*i+1).A073595
Denominator of b(n) = Sum_{k=1..n} (-1)^(k+1)/k*Sum_{i=0..k-1} (-1)^i/(2*i+1).
- Expansion of e.g.f. exp(x) * log(1-x)/(x-1).A073596
Expansion of e.g.f. exp(x) * log(1-x)/(x-1).
- Write Pi = 3.d(1)d(2)d(3)... where d(m) is the m-th digit of the decimal expansion of Pi. Then a(n) = m is the smallest integer such that 1/(n+1) < 0.d(m)d(m+1)d(m+2)... < 1/n.A073597
Write Pi = 3.d(1)d(2)d(3)... where d(m) is the m-th digit of the decimal expansion of Pi. Then a(n) = m is the smallest integer such that 1/(n+1) < 0.d(m)d(m+1)d(m+2)... < 1/n.
- Numbers n such that n^3 + 5 is prime.A073598
Numbers n such that n^3 + 5 is prime.
- Numbers k such that the denominator of Sum_{j=1..k} 1/phi(j) divides the denominator of H(k) = Sum_{j=1..k} 1/j, the k-th harmonic number.A073599
Numbers k such that the denominator of Sum_{j=1..k} 1/phi(j) divides the denominator of H(k) = Sum_{j=1..k} 1/j, the k-th harmonic number.
- Least n^k with same leading decimal digit as n, k>1.A073600
Least n^k with same leading decimal digit as n, k>1.
- Least k>1 such that n^k and n have equal leading decimal digits.A073601
Least k>1 such that n^k and n have equal leading decimal digits.
- a(n) is the smallest prime different from a(k) for k < n such that sum(a(j), j=1..n) is a multiple of the n-th prime.A073602
a(n) is the smallest prime different from a(k) for k < n such that sum(a(j), j=1..n) is a multiple of the n-th prime.
- Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.A073603
Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.
- Smallest multiple of (n+1)-st prime which is == 1 mod n-th prime.A073604
Smallest multiple of (n+1)-st prime which is == 1 mod n-th prime.
- Smallest number m such that m + k == 0 mod k-th prime for all k from 1 to n.A073605
Smallest number m such that m + k == 0 mod k-th prime for all k from 1 to n.
- Smaller of two consecutive integers divisible respectively by two consecutive primes.A073606
Smaller of two consecutive integers divisible respectively by two consecutive primes.
- Smallest of three consecutive integers divisible by three consecutive primes respectively.A073607
Smallest of three consecutive integers divisible by three consecutive primes respectively.
- a(1) = 1, a(n) = smallest number such that a(n) - a(n-k) is a prime power > 1 for all k.A073608
a(1) = 1, a(n) = smallest number such that a(n) - a(n-k) is a prime power > 1 for all k.
- a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.A073609
a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.
- Number of primes of the form n-p where p is a prime.A073610
Number of primes of the form n-p where p is a prime.