Sequences
392,541 sequences
- Decimal expansion of (24*e^5 - 96*e^4 + 108*e^3 - 32*e^2 + e)/24.A090611
Decimal expansion of (24*e^5 - 96*e^4 + 108*e^3 - 32*e^2 + e)/24.
- Numbers k such that the k-th prime is of the form 2*j^2 + 1.A090612
Numbers k such that the k-th prime is of the form 2*j^2 + 1.
- Numbers k such that the k-th prime is congruent to 3 mod 7.A090613
Numbers k such that the k-th prime is congruent to 3 mod 7.
- Numbers n such that 14n+3 is prime.A090614
Numbers n such that 14n+3 is prime.
- Smallest member of sociable quadruples.A090615
Smallest member of sociable quadruples.
- Exponent of highest power of 4 dividing n!.A090616
Exponent of highest power of 4 dividing n!.
- Exponent of highest power of 8 dividing n!.A090617
Exponent of highest power of 8 dividing n!.
- Highest power of 9 dividing n!.A090618
Highest power of 9 dividing n!.
- Highest power of 12 dividing n!.A090619
Highest power of 12 dividing n!.
- Highest power of 13 dividing n!.A090620
Highest power of 13 dividing n!.
- Exponent of highest power of 16 dividing n!.A090621
Exponent of highest power of 16 dividing n!.
- Square array read by antidiagonals of highest power of k dividing n! (with n,k>1).A090622
Square array read by antidiagonals of highest power of k dividing n! (with n,k>1).
- Triangle of T(n,k) = [n/k] + [n/k^2] + [n/k^3] + [n/k^4] + ... for n, k > 1.A090623
Triangle of T(n,k) = [n/k] + [n/k^2] + [n/k^3] + [n/k^4] + ... for n, k > 1.
- If n = Product(pj^ej), i.e., written in its prime factorization, then a(n) = max_j{(pj-1)*ej}.A090624
If n = Product(pj^ej), i.e., written in its prime factorization, then a(n) = max_j{(pj-1)*ej}.
- Decimal expansion of real solution of x^x = 10.A090625
Decimal expansion of real solution of x^x = 10.
- T(n,k) = if (k-th digit of pi) = (n-th digit of pi) then 1 else 0, 1<=k<=n (pi=3.14159... ), triangular array read by rows.A090626
T(n,k) = if (k-th digit of pi) = (n-th digit of pi) then 1 else 0, 1<=k<=n (pi=3.14159... ), triangular array read by rows.
- Numbers belonging to both A077225 and A080797 (in the order in which they appear in A077225).A090627
Numbers belonging to both A077225 and A080797 (in the order in which they appear in A077225).
- Square array T(n,k) (row n, column k) read by antidiagonals defined by: T(n,k) is the permanent of the n X n matrix with 1 on the diagonal and k elsewhere; T(0,k)=1.A090628
Square array T(n,k) (row n, column k) read by antidiagonals defined by: T(n,k) is the permanent of the n X n matrix with 1 on the diagonal and k elsewhere; T(0,k)=1.
- a(n) = abs(numerator of 2n-th Bernoulli number) modulo 3.A090629
a(n) = abs(numerator of 2n-th Bernoulli number) modulo 3.
- Greatest divisor d of n! such that d=m^k with k>1.A090630
Greatest divisor d of n! such that d=m^k with k>1.
- Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.A090631
Given n boxes labeled 1..n, such that box i weighs 2i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.
- Given n boxes labeled 1..n, such that box i weighs 3i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.A090632
Given n boxes labeled 1..n, such that box i weighs 3i grams and can support a total weight of i grams; a(n) = number of stacks of boxes that can be formed such that no box is squashed.
- Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = numerator of F(n).A090633
Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = numerator of F(n).
- Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).A090634
Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = denominator of F(n).
- Trajectory of 63 under the map k -> A003415(k) (taking the arithmetic derivative).A090635
Trajectory of 63 under the map k -> A003415(k) (taking the arithmetic derivative).
- Trajectory of 15 under the map k -> A003415(k) (taking the arithmetic derivative).A090636
Trajectory of 15 under the map k -> A003415(k) (taking the arithmetic derivative).
- Trajectory of 28 under the map k -> A003415(k) (taking the arithmetic derivative).A090637
Trajectory of 28 under the map k -> A003415(k) (taking the arithmetic derivative).
- Duplicate of A073869.A090638
Duplicate of A073869.
- a(0) = 0; a(2n) = 3*a(n), a(2n+1) = a(n) + 1.A090639
a(0) = 0; a(2n) = 3*a(n), a(2n+1) = a(n) + 1.
- a(0) = 0; a(2n) = 4*a(n), a(2n+1) = a(n) + 1.A090640
a(0) = 0; a(2n) = 4*a(n), a(2n+1) = a(n) + 1.
- Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.A090641
Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.
- Triangle read by rows: T(n,k) = binomial(n^2, k), 0 <= k <= n.A090642
Triangle read by rows: T(n,k) = binomial(n^2, k), 0 <= k <= n.
- a(n) = (-1)^(n+1)*(3/4)*(9^n-1)*B(2*n) where B(k) denotes the k-th Bernoulli number.A090643
a(n) = (-1)^(n+1)*(3/4)*(9^n-1)*B(2*n) where B(k) denotes the k-th Bernoulli number.
- a(n)=(-1)^(n+1)*(5/4)*(25^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.A090644
a(n)=(-1)^(n+1)*(5/4)*(25^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.
- a(n)=(-1)^(n+1)*2*(16^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.A090645
a(n)=(-1)^(n+1)*2*(16^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.
- a(n) = (-1)^(n+1)*6*(36^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.A090646
a(n) = (-1)^(n+1)*6*(36^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.
- a(n)=(-1)^(n+1)*(7/8)*(49^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.A090647
a(n)=(-1)^(n+1)*(7/8)*(49^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.
- a(n)=2*(4^n-1)/denominator(B(2n)) where B(k) denotes the k-th Bernoulli number.A090648
a(n)=2*(4^n-1)/denominator(B(2n)) where B(k) denotes the k-th Bernoulli number.
- Numbers k such that 9^k + 2 is prime.A090649
Numbers k such that 9^k + 2 is prime.
- a(n) = n^(n+6).A090650
a(n) = n^(n+6).
- Perpetual calendar sequence: There are 14 basic year calendars, 7 for normal years and 7 for leap years. This sequence identifies the calendars for years 1901 through 2099, when it reinitializes because 2100 is not a leap year.A090651
Perpetual calendar sequence: There are 14 basic year calendars, 7 for normal years and 7 for leap years. This sequence identifies the calendars for years 1901 through 2099, when it reinitializes because 2100 is not a leap year.
- Numbers all of whose prime factors end in 7.A090652
Numbers all of whose prime factors end in 7.
- Number of bimagic series for cubes of order n.A090653
Number of bimagic series for cubes of order n.
- Decimal expansion of 4 + 2*sqrt(6).A090654
Decimal expansion of 4 + 2*sqrt(6).
- Decimal expansion of solution to n/x = x-n for n = 9.A090655
Decimal expansion of solution to n/x = x-n for n = 9.
- Decimal expansion of 5 + sqrt(35).A090656
Decimal expansion of 5 + sqrt(35).
- Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).A090657
Triangle read by rows: T(n,k) = number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly k elements (0<=k<=n).
- Numbers n such that n-1 is a prime of the form 4k+3.A090658
Numbers n such that n-1 is a prime of the form 4k+3.
- Odd composites with increasing proportion of nontrivial non-witnesses of compositeness by the Miller-Rabin primality test.A090659
Odd composites with increasing proportion of nontrivial non-witnesses of compositeness by the Miller-Rabin primality test.
- Numbers n such that n*nextprime((n-1)!)-nextprime(n!) < 0.A090660
Numbers n such that n*nextprime((n-1)!)-nextprime(n!) < 0.