Sequences
392,541 sequences
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.A094811
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.
- Number of odd composites between 2^n and 2^(n + 1).A094812
Number of odd composites between 2^n and 2^(n + 1).
- a(n) = number of (0,1) matrices of size n X n whose determinants are k, where -L <= k <= +L and L = A003432(n).A094813
a(n) = number of (0,1) matrices of size n X n whose determinants are k, where -L <= k <= +L and L = A003432(n).
- a(n) = n^(prime(prime(n))).A094814
a(n) = n^(prime(prime(n))).
- (prime(prime(n)))^n.A094815
(prime(prime(n)))^n.
- Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.A094816
Triangle read by rows: T(n,k) are the coefficients of Charlier polynomials: A046716 transposed, for 0 <= k <= n.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.A094817
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.
- Number of classes of dp-homogeneous spherical curves with n double points.A094818
Number of classes of dp-homogeneous spherical curves with n double points.
- Number of steps needed for juggler sequence (A094683) started at 10^n to reach 1.A094819
Number of steps needed for juggler sequence (A094683) started at 10^n to reach 1.
- Partial sums of A038548.A094820
Partial sums of A038548.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 5.A094821
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 8 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 5.
- E.g.f.: exp(3x)/(1-3x)^(1/3).A094822
E.g.f.: exp(3x)/(1-3x)^(1/3).
- If n = c0 + c1*10 + c2*10^2 + ...cn*10^n then a(n) = c0 + c1*13 + c2*13^2 + ...cn*13^k.A094823
If n = c0 + c1*10 + c2*10^2 + ...cn*10^n then a(n) = c0 + c1*13 + c2*13^2 + ...cn*13^k.
- Maximum number of longest common substrings of two binary sequences of length n.A094824
Maximum number of longest common substrings of two binary sequences of length n.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 7.A094825
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 7.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.A094826
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 3.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.A094827
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 4.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 5.A094828
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 5.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.A094829
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6.
- Start with x = n, repeatedly replace x with x + sum of squares of digits of x until you reach a prime; sequence gives number of steps.A094830
Start with x = n, repeatedly replace x with x + sum of squares of digits of x until you reach a prime; sequence gives number of steps.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.A094831
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 3.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4.A094832
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 4.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 5.A094833
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 3, s(2n) = 5.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 6.A094834
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 3, s(2n+1) = 6.
- a(n) = 2702*a(n-1) - a(n-2); a(-1) = a(0) = 26.A094835
a(n) = 2702*a(n-1) - a(n-2); a(-1) = a(0) = 26.
- a(n) = 2702*a(n-1) - a(n-2); a(-1) = -15; a(0) = 15.A094836
a(n) = 2702*a(n-1) - a(n-2); a(-1) = -15; a(0) = 15.
- Maximal number of longest common subsequences between any two binary strings of length n (Version 1).A094837
Maximal number of longest common subsequences between any two binary strings of length n (Version 1).
- The longest subsequence length that provides an example for A094837.A094838
The longest subsequence length that provides an example for A094837.
- 5th row of array in A094781.A094839
5th row of array in A094781.
- a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Linus sequence A006345.A094840
a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Linus sequence A006345.
- Let p = n-th odd prime. Then a(n) = least positive integer congruent to 3 modulo 8 such that Legendre(-a(n), q) = -1 for all odd primes q <= p.A094841
Let p = n-th odd prime. Then a(n) = least positive integer congruent to 3 modulo 8 such that Legendre(-a(n), q) = -1 for all odd primes q <= p.
- Class numbers associated with entries of A094841.A094842
Class numbers associated with entries of A094841.
- Records in A094841.A094843
Records in A094841.
- Class numbers associated with the entries of A094843.A094844
Class numbers associated with the entries of A094843.
- Records in A001986.A094845
Records in A001986.
- Records in A001987.A094846
Records in A001987.
- Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.A094847
Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.
- Class numbers associated with entries in A094847.A094848
Class numbers associated with entries in A094847.
- Records in A094847.A094849
Records in A094847.
- Class numbers associated with entries in A094849.A094850
Class numbers associated with entries in A094849.
- Class numbers associated with entries of A001992.A094851
Class numbers associated with entries of A001992.
- Records in A001992.A094852
Records in A001992.
- Class numbers associated with entries of A094852.A094853
Class numbers associated with entries of A094852.
- Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 4, s(2n) = 4.A094854
Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 4, s(2n) = 4.
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 4, s(2n+1) = 5.A094855
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 4, s(2n+1) = 5.
- E.g.f.: exp(4x)/(1-4x)^(1/4).A094856
E.g.f.: exp(4x)/(1-4x)^(1/4).
- Coefficient of identity representation in k-th tensor power of the irreducible representation of S_n indexed by (n-2,1,1).A094857
Coefficient of identity representation in k-th tensor power of the irreducible representation of S_n indexed by (n-2,1,1).
- Maximal number of longest common subsequences between any two binary strings of length n (Version 2).A094858
Maximal number of longest common subsequences between any two binary strings of length n (Version 2).
- Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).A094859
Maximal number of longest common subsequences between any two ternary strings of length n (Version 2).
- Same as A094858, except that we fix X = 121212...12(1).A094860
Same as A094858, except that we fix X = 121212...12(1).