Sequences
392,541 sequences
- Cube root of n-th partial sum of A090960.A090961
Cube root of n-th partial sum of A090960.
- Least multiple of n such that the n-th partial sum is an n-th power with the condition that a(n+1) exists.A090962
Least multiple of n such that the n-th partial sum is an n-th power with the condition that a(n+1) exists.
- n-th root of the n-th partial sum of A090962.A090963
n-th root of the n-th partial sum of A090962.
- Permutation of natural numbers generated by 2-rowed array shown below.A090964
Permutation of natural numbers generated by 2-rowed array shown below.
- a(n) = 8*a(n-1) - 4*a(n-2), where a(0) = 1, a(1) = 4.A090965
a(n) = 8*a(n-1) - 4*a(n-2), where a(0) = 1, a(1) = 4.
- Decimal expansion of sum(k>=0,sin(Pi*phi^k)) where phi=(1+sqrt(5))/2.A090966
Decimal expansion of sum(k>=0,sin(Pi*phi^k)) where phi=(1+sqrt(5))/2.
- Given the sequence of the sums of the divisors of the semiprimes, this is the subsequence where each sum is an even number.A090967
Given the sequence of the sums of the divisors of the semiprimes, this is the subsequence where each sum is an even number.
- Primes p such that p^2 divides 19^(p-1) - 1.A090968
Primes p such that p^2 divides 19^(p-1) - 1.
- a(n) = 1/Integral_{x=0..1} (x^5 - x^6)^n.A090969
a(n) = 1/Integral_{x=0..1} (x^5 - x^6)^n.
- Number of primes strictly between T(n) and T(n+1), where T(n) = n-th triangular number.A090970
Number of primes strictly between T(n) and T(n+1), where T(n) = n-th triangular number.
- Sierpiński's triangle, read by rows, starting from 1: T(n,k) = (T(n-1,k) + T(n-1,k-1)) mod 2.A090971
Sierpiński's triangle, read by rows, starting from 1: T(n,k) = (T(n-1,k) + T(n-1,k-1)) mod 2.
- Least k such that there are at least n primes between n and n*k.A090972
Least k such that there are at least n primes between n and n*k.
- a(n) = ceiling(prime(n)/n).A090973
a(n) = ceiling(prime(n)/n).
- Duplicate of A038606.A090974
Duplicate of A038606.
- Least integer k such that n!+1-k is prime.A090975
Least integer k such that n!+1-k is prime.
- a(n) = 100 reduced mod n.A090976
a(n) = 100 reduced mod n.
- Least k such that k*prime(k) > 10^n.A090977
Least k such that k*prime(k) > 10^n.
- a(n) = n + Sum{a(k): 1<=k<n and a(k) divides n}.A090978
a(n) = n + Sum{a(k): 1<=k<n and a(k) divides n}.
- From the sequence of natural numbers, go on deleting n smallest multiples of n (>n) not deleted earlier; a(n) = the largest number deleted.A090979
From the sequence of natural numbers, go on deleting n smallest multiples of n (>n) not deleted earlier; a(n) = the largest number deleted.
- From the set of numbers > 1, go on deleting n smallest numbers relatively prime to n that were not deleted earlier; a(n) = the largest number deleted.A090980
From the set of numbers > 1, go on deleting n smallest numbers relatively prime to n that were not deleted earlier; a(n) = the largest number deleted.
- Triangle read by rows: T(n,k) = number of Schroeder paths of length 2n and having k ascents.A090981
Triangle read by rows: T(n,k) = number of Schroeder paths of length 2n and having k ascents.
- a(n) = partitions(n)*partitions(n+1).A090982
a(n) = partitions(n)*partitions(n+1).
- a(n) is the least nonsquare having square residues modulo each of the first n primes.A090983
a(n) is the least nonsquare having square residues modulo each of the first n primes.
- a(n) is the number of pairs (x,y) where x is plane partition of n+1 and y is a plane partition of n and x covers y.A090984
a(n) is the number of pairs (x,y) where x is plane partition of n+1 and y is a plane partition of n and x covers y.
- Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having exactly k triangles (n >= 2, k >= 0).A090985
Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having exactly k triangles (n >= 2, k >= 0).
- Decimal expansion of Pi/sinh(Pi).A090986
Decimal expansion of Pi/sinh(Pi).
- a(n) is the smallest prime whose square divides the numerator of the Bernoulli number B(A090997(n)).A090987
a(n) is the smallest prime whose square divides the numerator of the Bernoulli number B(A090997(n)).
- a(n) = 2^A004736(n).A090988
a(n) = 2^A004736(n).
- Number of meaningful differential operations of the n-th order on the space R^4.A090989
Number of meaningful differential operations of the n-th order on the space R^4.
- Number of meaningful differential operations of the n-th order on the space R^5.A090990
Number of meaningful differential operations of the n-th order on the space R^5.
- Number of meaningful differential operations of the n-th order on the space R^6.A090991
Number of meaningful differential operations of the n-th order on the space R^6.
- Number of meaningful differential operations of the n-th order on the space R^7.A090992
Number of meaningful differential operations of the n-th order on the space R^7.
- Number of meaningful differential operations of the n-th order on the space R^8.A090993
Number of meaningful differential operations of the n-th order on the space R^8.
- Number of meaningful differential operations of the n-th order on the space R^9.A090994
Number of meaningful differential operations of the n-th order on the space R^9.
- Number of meaningful differential operations of the n-th order on the space R^10.A090995
Number of meaningful differential operations of the n-th order on the space R^10.
- Number of leading 1's in binary expansion of n.A090996
Number of leading 1's in binary expansion of n.
- Numbers m such that the numerator of the Bernoulli number B(m) is divisible by a square.A090997
Numbers m such that the numerator of the Bernoulli number B(m) is divisible by a square.
- Decimal expansion of lim_{k -> +-oo} k^2*(1 - Gamma(1+i/k)) where i^2 = -1 and Gamma is the Gamma function.A090998
Decimal expansion of lim_{k -> +-oo} k^2*(1 - Gamma(1+i/k)) where i^2 = -1 and Gamma is the Gamma function.
- Numbers k such that sigma(k)-k = pi(sigma(k)).A090999
Numbers k such that sigma(k)-k = pi(sigma(k)).
- Number of closed walks of length n on the Petersen graph rooted at a given vertex.A091000
Number of closed walks of length n on the Petersen graph rooted at a given vertex.
- Number of walks of length n between adjacent nodes on the Petersen graph.A091001
Number of walks of length n between adjacent nodes on the Petersen graph.
- Number of walks of length n between non-adjacent nodes on the Petersen graph.A091002
Number of walks of length n between non-adjacent nodes on the Petersen graph.
- Expansion of (1-3*x^2)/((1-2*x)*(1+3*x)).A091003
Expansion of (1-3*x^2)/((1-2*x)*(1+3*x)).
- Expansion of x*(1-x)/((1-2*x)*(1+3*x)).A091004
Expansion of x*(1-x)/((1-2*x)*(1+3*x)).
- Expansion of x^2/((1-2*x)*(1+3*x)).A091005
Expansion of x^2/((1-2*x)*(1+3*x)).
- Triangle T(n,k) read by rows giving number of inequivalent indecomposable binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).A091006
Triangle T(n,k) read by rows giving number of inequivalent indecomposable binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).
- Decimal expansion of Sum_{n>=1} arccot(n^2).A091007
Decimal expansion of Sum_{n>=1} arccot(n^2).
- Triangle T(n,k) read by rows giving number of inequivalent binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).A091008
Triangle T(n,k) read by rows giving number of inequivalent binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).
- Number of triples (u,v,w) of divisors of n with v-u = w-v, and u < v < w.A091009
Number of triples (u,v,w) of divisors of n with v-u = w-v, and u < v < w.
- Numbers having no divisor d such that also d-x and d+x are divisors for some x.A091010
Numbers having no divisor d such that also d-x and d+x are divisors for some x.