Sequences
392,541 sequences
- Expansion of e.g.f. exp(7*x)/(1-7*x)^(1/7).A094911
Expansion of e.g.f. exp(7*x)/(1-7*x)^(1/7).
- Output from a certain finite automaton when fed binary representation of n read from right to left.A094912
Output from a certain finite automaton when fed binary representation of n read from right to left.
- Maximal number of distinct nonempty substrings of any binary string of length n.A094913
Maximal number of distinct nonempty substrings of any binary string of length n.
- Absolute value of n^2 + n - 1354363.A094914
Absolute value of n^2 + n - 1354363.
- Omit the 1's from A090822.A094915
Omit the 1's from A090822.
- a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Fibonacci word A003849 (with offset changed to 1).A094916
a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Fibonacci word A003849 (with offset changed to 1).
- Contract every run of consecutive identical terms in A090822 to a single term.A094917
Contract every run of consecutive identical terms in A090822 to a single term.
- a(n) = (3^n-1)/2 mod n.A094918
a(n) = (3^n-1)/2 mod n.
- a(n) = (4^n-1)/3 mod n.A094919
a(n) = (4^n-1)/3 mod n.
- a(n) = (5^n-1)/4 mod n.A094920
a(n) = (5^n-1)/4 mod n.
- a(n) = (6^n-1)/5 mod n.A094921
a(n) = (6^n-1)/5 mod n.
- a(n) = (7^n-1)/6 mod n.A094922
a(n) = (7^n-1)/6 mod n.
- (8^n-1)/7 mod n.A094923
(8^n-1)/7 mod n.
- a(n) = (9^n-1)/8 mod n.A094924
a(n) = (9^n-1)/8 mod n.
- A hexagonal spiral Fibonacci sequence.A094925
A hexagonal spiral Fibonacci sequence.
- A hexagonal spiral Fibonacci sequence.A094926
A hexagonal spiral Fibonacci sequence.
- Number of nonisomorphic (possibly decomposable) self-dual quantum codes on n qubits.A094927
Number of nonisomorphic (possibly decomposable) self-dual quantum codes on n qubits.
- Let p = n-th prime == 1 mod 8 (A007519); a(n) = smallest prime q such that p is not a square mod q.A094928
Let p = n-th prime == 1 mod 8 (A007519); a(n) = smallest prime q such that p is not a square mod q.
- Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.A094929
Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.
- Triangle T(n,m) read by rows, defined by squaring a matrix with row entries 2+3*(m-1).A094930
Triangle T(n,m) read by rows, defined by squaring a matrix with row entries 2+3*(m-1).
- A measure of the excess of the mean of the set of 4 consecutive primes over the 2nd of the set.A094931
A measure of the excess of the mean of the set of 4 consecutive primes over the 2nd of the set.
- Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.A094932
Primes that represent some mean of 4 consecutive (2 smaller, itself, 1 larger) primes.
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.A094933
Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.
- Write binary digits of numbers 1, 2, 3, ... in a string; sequence gives the prime indexed digits.A094934
Write binary digits of numbers 1, 2, 3, ... in a string; sequence gives the prime indexed digits.
- E.g.f.: exp(8x)/(1-8x)^(1/8).A094935
E.g.f.: exp(8x)/(1-8x)^(1/8).
- Decimal expansion of 2/(Pi*e).A094936
Decimal expansion of 2/(Pi*e).
- Number of real roots of the n-th Bernoulli polynomial B(n,x).A094937
Number of real roots of the n-th Bernoulli polynomial B(n,x).
- a(n)=(-36^n/18)*B(2n,1/6)/B(2n,1/3) where B(n,x) is the n-th Bernoulli polynomial.A094938
a(n)=(-36^n/18)*B(2n,1/6)/B(2n,1/3) where B(n,x) is the n-th Bernoulli polynomial.
- a(n) = floor(2^n*log(n)).A094939
a(n) = floor(2^n*log(n)).
- a(n) = floor(n^n*log(n)).A094940
a(n) = floor(n^n*log(n)).
- a(n) is n! times the coefficient of Pi^floor(n/2) in the volume of an n-dimensional unit ball.A094941
a(n) is n! times the coefficient of Pi^floor(n/2) in the volume of an n-dimensional unit ball.
- Numbers having a unique partition into three squares.A094942
Numbers having a unique partition into three squares.
- A sequence generated from a semi-magic square.A094943
A sequence generated from a semi-magic square.
- A sequence with a(n)/a(n-1) converging to 7, generated from a semi-magic square.A094944
A sequence with a(n)/a(n-1) converging to 7, generated from a semi-magic square.
- Initial n terms of A023532(n) taken as digits.A094945
Initial n terms of A023532(n) taken as digits.
- a(n) is 10110(3 1's)0...0(n 1's).A094946
a(n) is 10110(3 1's)0...0(n 1's).
- G.f.: A(x) = Product_{n>=1} 1/(1 - A007947(n)*x^n)^(1/n), where A007947(n) is the product of the distinct prime factors of n.A094947
G.f.: A(x) = Product_{n>=1} 1/(1 - A007947(n)*x^n)^(1/n), where A007947(n) is the product of the distinct prime factors of n.
- Number of letters in n^2.A094948
Number of letters in n^2.
- Phi(m)*sigma(m), where m is the product of exactly two primes that differ by 2, where phi=A000010, sigma=A000203.A094949
Phi(m)*sigma(m), where m is the product of exactly two primes that differ by 2, where phi=A000010, sigma=A000203.
- Number of integer coefficients in n-th Bernoulli polynomial (including zeros).A094950
Number of integer coefficients in n-th Bernoulli polynomial (including zeros).
- a(n) = A081038(n) + A077616(n).A094951
a(n) = A081038(n) + A077616(n).
- A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.A094952
A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.
- Triangle T(n,m) read by rows: number of rises (drops) in the compositions of n with m parts, m>=2.A094953
Triangle T(n,m) read by rows: number of rises (drops) in the compositions of n with m parts, m>=2.
- Array T(k,n) read by antidiagonals. G.f.: x(1-x)/(1-kx+x^2), k>1.A094954
Array T(k,n) read by antidiagonals. G.f.: x(1-x)/(1-kx+x^2), k>1.
- Main diagonal of array A094954.A094955
Main diagonal of array A094954.
- Diagonal T(n+2,n) of array A094954.A094956
Diagonal T(n+2,n) of array A094954.
- Antidiagonal sums of array A094954.A094957
Antidiagonal sums of array A094954.
- Numbers of the form 2^k or 5*2^k.A094958
Numbers of the form 2^k or 5*2^k.
- Number of positive integer coefficients in n-th Bernoulli polynomial.A094959
Number of positive integer coefficients in n-th Bernoulli polynomial.
- Positive integers k such that the derivative of the k-th Bernoulli polynomial B(k,x) contains only integer coefficients.A094960
Positive integers k such that the derivative of the k-th Bernoulli polynomial B(k,x) contains only integer coefficients.