Sequences
392,541 sequences
- Total number of largest parts in all partitions of n into odd parts.A092311
Total number of largest parts in all partitions of n into odd parts.
- Number of trimagic series for cubes of order n.A092312
Number of trimagic series for cubes of order n.
- Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts.A092313
Sum of smallest parts (counted with multiplicity) of all partitions of n into odd parts.
- Sum of smallest parts of all partitions of n into odd parts.A092314
Sum of smallest parts of all partitions of n into odd parts.
- a(n) is the smallest m such that the partial sum of the odd harmonic series Sum_{j=0..m} 1/(2j+1) is > n.A092315
a(n) is the smallest m such that the partial sum of the odd harmonic series Sum_{j=0..m} 1/(2j+1) is > n.
- Sum of largest parts of all partitions of n into odd distinct parts.A092316
Sum of largest parts of all partitions of n into odd distinct parts.
- a(n) = smallest odd number 2m+1 such that the partial sum Sum_{j=0..m} 1/(2j+1) of the odd harmonic series is >= n.A092317
a(n) = smallest odd number 2m+1 such that the partial sum Sum_{j=0..m} 1/(2j+1) of the odd harmonic series is >= n.
- a(n) = smallest m such that value of odd harmonic series Sum_{j=0..m} 1/(2j+1) is >= n.A092318
a(n) = smallest m such that value of odd harmonic series Sum_{j=0..m} 1/(2j+1) is >= n.
- Sum of smallest parts of all partitions of n into odd distinct parts.A092319
Sum of smallest parts of all partitions of n into odd distinct parts.
- "Word-factorable" numbers, or numbers k that are divisible by the number of letters in the American English word(s) for k.A092320
"Word-factorable" numbers, or numbers k that are divisible by the number of letters in the American English word(s) for k.
- Sum of largest parts (counted with multiplicity) of all partitions of n.A092321
Sum of largest parts (counted with multiplicity) of all partitions of n.
- Sum of largest parts of all partitions of n into odd parts.A092322
Sum of largest parts of all partitions of n into odd parts.
- 2^m - 1 appears 2^m times.A092323
2^m - 1 appears 2^m times.
- Values m_0 = 0, m_1, m_2, ... associated with divergent series T shown below.A092324
Values m_0 = 0, m_1, m_2, ... associated with divergent series T shown below.
- a(n) = min{ m : sum_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i).A092325
a(n) = min{ m : sum_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i).
- Permanent of the inverse of the n-th Hilbert matrix divided by the determinant of the inverse of the n-th Hilbert matrix.A092326
Permanent of the inverse of the n-th Hilbert matrix divided by the determinant of the inverse of the n-th Hilbert matrix.
- a(n) = (1/12)*(n+1)*(n^3+19*n^2+118*n+228).A092327
a(n) = (1/12)*(n+1)*(n^3+19*n^2+118*n+228).
- Solutions of x^2 = ceiling(x*r*floor(x/r)) where r=Pi.A092328
Solutions of x^2 = ceiling(x*r*floor(x/r)) where r=Pi.
- Number of nonisomorphic, constructed lattice-square designs of order n as n runs through the odd prime-powers (3, 5, 7, 9, 11, 13, ...).A092329
Number of nonisomorphic, constructed lattice-square designs of order n as n runs through the odd prime-powers (3, 5, 7, 9, 11, 13, ...).
- Fibonacci quotients: Fibonacci(p - Legendre(p|5))/p where p runs through the primes.A092330
Fibonacci quotients: Fibonacci(p - Legendre(p|5))/p where p runs through the primes.
- For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k], where each y_i is positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.A092331
For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k], where each y_i is positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.
- For S a string of numbers, let F(S) = the product of those numbers. Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.A092332
For S a string of numbers, let F(S) = the product of those numbers. Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.
- For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily equal) length and for any i<k, F(y_i)>=F(y_(i+1)).A092333
For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily equal) length and for any i<k, F(y_i)>=F(y_(i+1)).
- For S a finite string of numbers, let M(S) denote the maximal number among them. Let a(1)=1. For n>1, a(n) is the greatest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily equal) length and M(y_i)=M(y_j) for all i,j.A092334
For S a finite string of numbers, let M(S) denote the maximal number among them. Let a(1)=1. For n>1, a(n) is the greatest k such that the string a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily equal) length and M(y_i)=M(y_j) for all i,j.
- Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).A092335
Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).
- Sum of first n perfect numbers.A092336
Sum of first n perfect numbers.
- Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).A092337
Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).
- a(n) = number of numbers d with n mod d <= 1.A092338
a(n) = number of numbers d with n mod d <= 1.
- Number of adjacent identical digits in the binary representation of n.A092339
Number of adjacent identical digits in the binary representation of n.
- Prime numbers n such that n^2+2*n divides (Fibonacci(n^2) + Fibonacci(2*n)).A092340
Prime numbers n such that n^2+2*n divides (Fibonacci(n^2) + Fibonacci(2*n)).
- a(0)=1, a(n) = sigma_3(3n).A092341
a(0)=1, a(n) = sigma_3(3n).
- a(n) = sigma_3(3n+1).A092342
a(n) = sigma_3(3n+1).
- a(n) = sigma_3(3n+2).A092343
a(n) = sigma_3(3n+2).
- a(0)=1; a(n) = sigma_2(n) + sigma_3(n).A092344
a(0)=1; a(n) = sigma_2(n) + sigma_3(n).
- a(0)=1; a(n) = sigma_1(n) + sigma_3(n).A092345
a(0)=1; a(n) = sigma_1(n) + sigma_3(n).
- a(0)=1; a(n) = sigma_1(n) + sigma_2(n).A092346
a(0)=1; a(n) = sigma_1(n) + sigma_2(n).
- a(0)=1; a(n) = sigma_1(n) + sigma_2(n) + sigma_3(n).A092347
a(0)=1; a(n) = sigma_1(n) + sigma_2(n) + sigma_3(n).
- a(n) = sigma_3(n) - sigma_1(n).A092348
a(n) = sigma_3(n) - sigma_1(n).
- a(n) = sigma_3(n) - sigma_2(n).A092349
a(n) = sigma_3(n) - sigma_2(n).
- a(n) = sigma_3(n) - sigma_2(n) - sigma_1(n).A092350
a(n) = sigma_3(n) - sigma_2(n) - sigma_1(n).
- Molien series for certain 16-dimensional group of order 322560 arising from genus-2 weight enumerators of singly-even (but not necessarily self-dual or self-orthogonal) binary codes.A092351
Molien series for certain 16-dimensional group of order 322560 arising from genus-2 weight enumerators of singly-even (but not necessarily self-dual or self-orthogonal) binary codes.
- G.f.: (1+3*x^3)/((1-x)^2*(1-x^3)^2).A092352
G.f.: (1+3*x^3)/((1-x)^2*(1-x^3)^2).
- Expansion of (1+x^3)/((1-x)^2*(1-x^3)^2).A092353
Expansion of (1+x^3)/((1-x)^2*(1-x^3)^2).
- Molien series for complete weight enumerators of Hermitian self-dual codes over GF(9).A092354
Molien series for complete weight enumerators of Hermitian self-dual codes over GF(9).
- Molien series for complete weight enumerators of Hermitian self-dual codes over GF(9) containing the all-ones vector.A092355
Molien series for complete weight enumerators of Hermitian self-dual codes over GF(9) containing the all-ones vector.
- UO-sigma multiperfect numbers: n such that A069184(n)/n is an integer.A092356
UO-sigma multiperfect numbers: n such that A069184(n)/n is an integer.
- Smallest value of x=a+b+c+d (a,b,c,d positive integers) such that there are n different values of m=a^2+b^2=c^2+d^2, or 0 if no such x exists.A092357
Smallest value of x=a+b+c+d (a,b,c,d positive integers) such that there are n different values of m=a^2+b^2=c^2+d^2, or 0 if no such x exists.
- Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest x such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.A092358
Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest x such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.
- Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest y such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.A092359
Let R_{k}(m) = the digit reversal of m in base k (R_{k}(m) is written in base 10). a(n) is the smallest y such that there are exactly n bases {k} (k >= 2 and (x < y)) solutions of the equation: R_{k}(x) = y and R_{k}(y) = x.
- Spiro-tribonacci numbers: a(n) = sum of three previous terms that are nearest when terms arranged in a spiral.A092360
Spiro-tribonacci numbers: a(n) = sum of three previous terms that are nearest when terms arranged in a spiral.