Sequences
392,541 sequences
- a(n) = Sum_{k=0..n} binomial(7*n,7*k).A094211
a(n) = Sum_{k=0..n} binomial(7*n,7*k).
- Duplicate of A070832.A094212
Duplicate of A070832.
- a(n) = Sum_{k=0..n} binomial(9*n,9*k).A094213
a(n) = Sum_{k=0..n} binomial(9*n,9*k).
- Decimal expansion of 1/phi = phi - 1.A094214
Decimal expansion of 1/phi = phi - 1.
- a(n)=A093878(n)-floor(n/phi) where phi=(1+sqrt(5))/2.A094215
a(n)=A093878(n)-floor(n/phi) where phi=(1+sqrt(5))/2.
- Triangle read by rows giving the coefficients of formulas generating each variety of S1(n,k) (unsigned Stirling numbers of first kind). The p-th row (p>=1) contains T(i,p) for i=1 to 2*p, where T(i,p) satisfies Sum_{i=1..2*p} T(i,p) * C(n,i).A094216
Triangle read by rows giving the coefficients of formulas generating each variety of S1(n,k) (unsigned Stirling numbers of first kind). The p-th row (p>=1) contains T(i,p) for i=1 to 2*p, where T(i,p) satisfies Sum_{i=1..2*p} T(i,p) * C(n,i).
- First differences of A093878.A094217
First differences of A093878.
- Number of permutations of length n with exactly 2 occurrences of the pattern 2-13.A094218
Number of permutations of length n with exactly 2 occurrences of the pattern 2-13.
- Number of permutations of length n with exactly 3 occurrences of the pattern 2-13.A094219
Number of permutations of length n with exactly 3 occurrences of the pattern 2-13.
- Primes p such that p+210*i is prime for i=1 to 9.A094220
Primes p such that p+210*i is prime for i=1 to 9.
- 1/detM(n) where M(n) is the n X n matrix m(i,j)=F(i)/F(i+j-1) and F(i)=i-th Fibonacci number.A094221
1/detM(n) where M(n) is the n X n matrix m(i,j)=F(i)/F(i+j-1) and F(i)=i-th Fibonacci number.
- a(n+1) = a(n) + (number of distinct prime factors of a(n)) for n>1; a(1)=1, a(2)=2.A094222
a(n+1) = a(n) + (number of distinct prime factors of a(n)) for n>1; a(1)=1, a(2)=2.
- Number of binary n X n matrices with all rows (columns) distinct, up to permutation of columns (rows).A094223
Number of binary n X n matrices with all rows (columns) distinct, up to permutation of columns (rows).
- Number of digits in the least n-transposable number.A094224
Number of digits in the least n-transposable number.
- Number of distinct n-row absolute difference tables that consist entirely of the first A000217(n) natural numbers.A094225
Number of distinct n-row absolute difference tables that consist entirely of the first A000217(n) natural numbers.
- Erroneous version of A000040.A094226
Erroneous version of A000040.
- A prime-power sequence based on Gaussian asymptotic function.A094227
A prime-power sequence based on Gaussian asymptotic function.
- Let s = -sqrt(2)*sqrt(n)*sqrt(1+I*n/(2*Pi))-n*log(n); then a(n) = floor(Re(-s)).A094228
Let s = -sqrt(2)*sqrt(n)*sqrt(1+I*n/(2*Pi))-n*log(n); then a(n) = floor(Re(-s)).
- Numbers n such that d(n) >= n-th harmonic number H(n)=sum_{i=1..n}1/i.A094229
Numbers n such that d(n) >= n-th harmonic number H(n)=sum_{i=1..n}1/i.
- Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).A094230
Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).
- Lesser member p of sexy primes (p, p+6) such that (p+1, p+2, p+3, p+4, p+5) all have the same number of prime divisors (counted with multiplicity).A094231
Lesser member p of sexy primes (p, p+6) such that (p+1, p+2, p+3, p+4, p+5) all have the same number of prime divisors (counted with multiplicity).
- a(n) = 24 written in base n.A094232
a(n) = 24 written in base n.
- Number of closed walks of length n at a vertex of the cyclic graph on 9 nodes C_9.A094233
Number of closed walks of length n at a vertex of the cyclic graph on 9 nodes C_9.
- a(n) = period of terms in quasi-periodic continued fraction expansion of 2^n*tanh(1).A094234
a(n) = period of terms in quasi-periodic continued fraction expansion of 2^n*tanh(1).
- Number of ways n can be written as the sum of a prime and a palindrome.A094235
Number of ways n can be written as the sum of a prime and a palindrome.
- Triangle read by rows: T(n,k) is the number of standard tableaux of shape (n,n,k) (0<=k<=n).A094236
Triangle read by rows: T(n,k) is the number of standard tableaux of shape (n,n,k) (0<=k<=n).
- Decimal expansion of (Pi + e)^2.A094237
Decimal expansion of (Pi + e)^2.
- Decimal expansion of (Pi + e)^3.A094238
Decimal expansion of (Pi + e)^3.
- Decimal expansion of (Pi + e)^(1/2).A094239
Decimal expansion of (Pi + e)^(1/2).
- Decimal expansion of (Pi + e)^(1/3).A094240
Decimal expansion of (Pi + e)^(1/3).
- Decimal expansion of 1/(Pi + e).A094241
Decimal expansion of 1/(Pi + e).
- Decimal expansion of 1/(Pi + e)^2.A094242
Decimal expansion of 1/(Pi + e)^2.
- Decimal expansion of 1/(Pi + e)^3.A094243
Decimal expansion of 1/(Pi + e)^3.
- Decimal expansion of 1/sqrt(Pi + e).A094244
Decimal expansion of 1/sqrt(Pi + e).
- Decimal expansion of (Pi + e)^(-1/3).A094245
Decimal expansion of (Pi + e)^(-1/3).
- Decimal expansion of (Pi + e)^e.A094246
Decimal expansion of (Pi + e)^e.
- Expansion of (phi(-q^5)^2 - phi(-q)^2) / 4 in powers of q where phi() is a Ramanujan theta function.A094247
Expansion of (phi(-q^5)^2 - phi(-q)^2) / 4 in powers of q where phi() is a Ramanujan theta function.
- Consider 3 X 3 matrix M = [0 1 0 / 0 0 1 / 5 2 0]; a(n) = the center term in M^n * [1 1 1].A094248
Consider 3 X 3 matrix M = [0 1 0 / 0 0 1 / 5 2 0]; a(n) = the center term in M^n * [1 1 1].
- Sequence A002313 is the sequence of primes p = a*a + b*b, starting 2,5,13,17,..., members p > 2 have p = 1 mod 4. In analogy to the definition of primorial primes use the primes of sequence A002313 to build the product, written here as cp#353+1 or cp#1609-1. If cp#n+1 or cp#n-1 is prime, then n is in the sequence. Using +1 or -1 to define the type of prime cp#n+-1 we get the sequence 1,1,1,1,-1,1,...A094249
Sequence A002313 is the sequence of primes p = a*a + b*b, starting 2,5,13,17,..., members p > 2 have p = 1 mod 4. In analogy to the definition of primorial primes use the primes of sequence A002313 to build the product, written here as cp#353+1 or cp#1609-1. If cp#n+1 or cp#n-1 is prime, then n is in the sequence. Using +1 or -1 to define the type of prime cp#n+-1 we get the sequence 1,1,1,1,-1,1,...
- Array, A(n, k) = ((n+2)^(k+1) + (k+1)*n*(n+1) - 1)/(n+1)^2, read by antidiagonals.A094250
Array, A(n, k) = ((n+2)^(k+1) + (k+1)*n*(n+1) - 1)/(n+1)^2, read by antidiagonals.
- Number of one-element transitions between all set partitions of n labeled elements.A094251
Number of one-element transitions between all set partitions of n labeled elements.
- a(n) = partition(n) mod prime(n).A094252
a(n) = partition(n) mod prime(n).
- Let M be the 3 X 3 Matrix [ -4 4 8 / 1 0 0 / 0 1 0], a(n) = absolute value of the center term of M^n * [1 1 1].A094253
Let M be the 3 X 3 Matrix [ -4 4 8 / 1 0 0 / 0 1 0], a(n) = absolute value of the center term of M^n * [1 1 1].
- Let M be the 3 X 3 matrix [ 6 0 -8 / 1 0 0 / 0 1 0]. Then M^n * [1 1 1] = [a(n-1), a(n), a(n+1)].A094254
Let M be the 3 X 3 matrix [ 6 0 -8 / 1 0 0 / 0 1 0]. Then M^n * [1 1 1] = [a(n-1), a(n), a(n+1)].
- Let M = the 3 X 3 matrix [ 0 1 0 / 0 0 1 / -1, 3*sqrt(3), 3]. M^n * [1 1 1] = [ p q r]; then a(n-1), a(n), a(n+1) = floor p, q, r, respectively.A094255
Let M = the 3 X 3 matrix [ 0 1 0 / 0 0 1 / -1, 3*sqrt(3), 3]. M^n * [1 1 1] = [ p q r]; then a(n-1), a(n), a(n+1) = floor p, q, r, respectively.
- Expansion of x / ( (x-1)*(x^3 - 9*x^2 + 6*x - 1) ).A094256
Expansion of x / ( (x-1)*(x^3 - 9*x^2 + 6*x - 1) ).
- Let M be the 3 X 3 matrix [0 1 0 / 0 0 1 / 7 -35 21]. Take M^n * [1 1 1] = [p q r]; then a(n-1), a(n), a(n+1) = -p, -q, -r respectively.A094257
Let M be the 3 X 3 matrix [0 1 0 / 0 0 1 / 7 -35 21]. Take M^n * [1 1 1] = [p q r]; then a(n-1), a(n), a(n+1) = -p, -q, -r respectively.
- a(1) = 1, a(n+1) = n*n! for n >= 1.A094258
a(1) = 1, a(n+1) = n*n! for n >= 1.
- Expansion of g.f.: (1-5*x)/((1-6*x)*(1-x)^2).A094259
Expansion of g.f.: (1-5*x)/((1-6*x)*(1-x)^2).
- Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers.A094260
Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers.