Sequences
392,541 sequences
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 7's.A072311
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 7's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 8's.A072312
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 8's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 9's.A072313
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 9's.
- Smallest Fibonacci number containing exactly n 9's.A072314
Smallest Fibonacci number containing exactly n 9's.
- Smallest Fibonacci number containing exactly n 8's.A072315
Smallest Fibonacci number containing exactly n 8's.
- Smallest Fibonacci number containing exactly n 7's.A072316
Smallest Fibonacci number containing exactly n 7's.
- Smallest Fibonacci number containing exactly n 6's.A072317
Smallest Fibonacci number containing exactly n 6's.
- Smallest Fibonacci number containing exactly n 5's.A072318
Smallest Fibonacci number containing exactly n 5's.
- Smallest Fibonacci number containing exactly n 4's.A072319
Smallest Fibonacci number containing exactly n 4's.
- Smallest Fibonacci number containing exactly n 3's.A072320
Smallest Fibonacci number containing exactly n 3's.
- Smallest Fibonacci number containing exactly n 2's.A072321
Smallest Fibonacci number containing exactly n 2's.
- Smallest Fibonacci number containing exactly n 1's.A072322
Smallest Fibonacci number containing exactly n 1's.
- Smallest Fibonacci number containing exactly n 0's.A072323
Smallest Fibonacci number containing exactly n 0's.
- Terms of A071383 such that A071383(n) = 5 * A071383(n-1).A072324
Terms of A071383 such that A071383(n) = 5 * A071383(n-1).
- Number of even numbers that cannot be expressed as the difference p-q of two odd primes q < p <= prime(n).A072325
Number of even numbers that cannot be expressed as the difference p-q of two odd primes q < p <= prime(n).
- Conjectured values of n such that the sum of proper divisors of x*n is never prime for any x >= 1 (i.e., sigma(xn) - xn is never prime for x >= 1).A072326
Conjectured values of n such that the sum of proper divisors of x*n is never prime for any x >= 1 (i.e., sigma(xn) - xn is never prime for x >= 1).
- Numbers k such that k^2 is a term of A072510.A072327
Numbers k such that k^2 is a term of A072510.
- a(n+1) = 2*a(n-2) + a(n-1), with a(0) = 3, a(1) = 0, and a(2) = 2.A072328
a(n+1) = 2*a(n-2) + a(n-1), with a(0) = 3, a(1) = 0, and a(2) = 2.
- a(n+1) = 3*a(n-2) + 2*a(n-1), a(n)=x^n+y^n+z^n.A072329
a(n+1) = 3*a(n-2) + 2*a(n-1), a(n)=x^n+y^n+z^n.
- Common difference n such that primitive triangles exist which are n-arithmetic (i.e., primitive Heronian triangles whose sides in arithmetic progression have common difference n).A072330
Common difference n such that primitive triangles exist which are n-arithmetic (i.e., primitive Heronian triangles whose sides in arithmetic progression have common difference n).
- a(n) = 2^(n-1) * Sum_{k=0..n} ((n+k)!/(n-k)!)/k!.A072331
a(n) = 2^(n-1) * Sum_{k=0..n} ((n+k)!/(n-k)!)/k!.
- Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along antidiagonals (A069480).A072332
Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along antidiagonals (A069480).
- Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along rows.A072333
Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along rows.
- Decimal expansion of e^2.A072334
Decimal expansion of e^2.
- Expansion of 1/((1-x^2)*(1-4*x+x^2)).A072335
Expansion of 1/((1-x^2)*(1-4*x+x^2)).
- EULER transform of A064831 (with its initial 1 omitted).A072336
EULER transform of A064831 (with its initial 1 omitted).
- Inverse EULER transform of A064831 (with its initial 1 omitted).A072337
Inverse EULER transform of A064831 (with its initial 1 omitted).
- EULER transform of A002620 (with the initial 0,0,1 omitted).A072338
EULER transform of A002620 (with the initial 0,0,1 omitted).
- Any number n can be written (in two ways, one with m even and one with m odd) in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_m where the signs alternate and k_1 > k_2 > k_3 > ... >k_m >= 0; sequence gives minimal value of m.A072339
Any number n can be written (in two ways, one with m even and one with m odd) in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_m where the signs alternate and k_1 > k_2 > k_3 > ... >k_m >= 0; sequence gives minimal value of m.
- Number of steps to reach an integer starting with n/3 and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.A072340
Number of steps to reach an integer starting with n/3 and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
- a(n) = the least natural number k such that k*sigma(n) + 1 is prime.A072341
a(n) = the least natural number k such that k*sigma(n) + 1 is prime.
- a(n) = the least natural number k such that k*reverse(n) + 1 is prime.A072342
a(n) = the least natural number k such that k*reverse(n) + 1 is prime.
- a(n) = 2^(n-1) * Sum_{k=0..n} (n+k)! / k!^2.A072343
a(n) = 2^(n-1) * Sum_{k=0..n} (n+k)! / k!^2.
- a(n) = the least natural number k such that k*phi(n) + 1 is prime.A072344
a(n) = the least natural number k such that k*phi(n) + 1 is prime.
- Volume of n-dimensional sphere of radius r is V_n*r^n = Pi^(n/2)*r^n/(n/2)! = C_n*Pi^floor(n/2)*r^n; sequence gives numerator of C_n.A072345
Volume of n-dimensional sphere of radius r is V_n*r^n = Pi^(n/2)*r^n/(n/2)! = C_n*Pi^floor(n/2)*r^n; sequence gives numerator of C_n.
- Volume of n-dimensional sphere of radius r is V_n*r^n = Pi^(n/2)*r^n/(n/2)! = C_n*Pi^floor(n/2)*r^n; sequence gives denominator of C_n.A072346
Volume of n-dimensional sphere of radius r is V_n*r^n = Pi^(n/2)*r^n/(n/2)! = C_n*Pi^floor(n/2)*r^n; sequence gives denominator of C_n.
- If n = pqr...st in binary, a(n) = value of continuant [p,q,r,...,s,t].A072347
If n = pqr...st in binary, a(n) = value of continuant [p,q,r,...,s,t].
- Number of primes whose decimal representation has the form rns where r and s are single digits.A072348
Number of primes whose decimal representation has the form rns where r and s are single digits.
- a(n) = m such that A064388(m) = n, or 0 if no such m exists.A072349
a(n) = m such that A064388(m) = n, or 0 if no such m exists.
- E.g.f. A(x) satisfies A(A(x)) = tan(x), where A(x) = Sum_{n>=1} a(n)*x^(2n-1)/(2n-1)!.A072350
E.g.f. A(x) satisfies A(A(x)) = tan(x), where A(x) = Sum_{n>=1} a(n)*x^(2n-1)/(2n-1)!.
- Smallest n-digit Fibonacci number.A072351
Smallest n-digit Fibonacci number.
- a(n) is the largest n-digit Fibonacci number.A072352
a(n) is the largest n-digit Fibonacci number.
- a(n) is the index of the largest Fibonacci number containing n digits.A072353
a(n) is the index of the largest Fibonacci number containing n digits.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing n digits.A072354
a(n)-th Fibonacci number is the smallest Fibonacci number containing n digits.
- Numbers k such that sigma(k) = (Pi^2)*(k/6) rounded off (where 0.5 is rounded to 0).A072355
Numbers k such that sigma(k) = (Pi^2)*(k/6) rounded off (where 0.5 is rounded to 0).
- a(n) = if n=p*q^2 for primes p<>q then q*p^2 else n.A072356
a(n) = if n=p*q^2 for primes p<>q then q*p^2 else n.
- Cubefree nonsquares whose factorization into a product of primes contains exactly one square.A072357
Cubefree nonsquares whose factorization into a product of primes contains exactly one square.
- Number of cubefree numbers <= n which are not squarefree.A072358
Number of cubefree numbers <= n which are not squarefree.
- Primes p such that the p-1 digits of the decimal expansion of k/p (for k=1,2,3,...,p-1) fit into the k-th row of a magic square grid of order p-1.A072359
Primes p such that the p-1 digits of the decimal expansion of k/p (for k=1,2,3,...,p-1) fit into the k-th row of a magic square grid of order p-1.
- One-sixth the area of the smallest primitive d-arithmetic triangle, where d=A072330(n).A072360
One-sixth the area of the smallest primitive d-arithmetic triangle, where d=A072330(n).