19376
domain: N
Appears in sequences
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RON = Roggianite Ca16[Be8Al16Si32O104(OH)16].19H2O starting with a T4 atom.at n=17A019216
- Sums of 4 distinct powers of 5.at n=31A038476
- a(n) = A055993(n) - A034444(A056627(n)).at n=35A056630
- a(n) = A055993(n) - A034444(A056627(n)).at n=36A056630
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=37A061154
- 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.at n=5A076760
- a(n) = 625*n + 1.at n=30A158383
- Number of binary strings of length n with no substrings equal to 0000 0010 or 1111.at n=14A164425
- G.f.: 1/(1-x-x^2-2*x^3-5*x^4).at n=13A212340
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 4.at n=19A241649
- Number of non-degenerate parallelograms in an n X n permutation array.at n=9A243643
- a(n) = 31*n^2 + 1.at n=25A247155
- Numbers k such that card({x|sigma(x)=k}) > 1 and (Sum_{sigma(x)=k} x) < k.at n=23A258931
- a(n) = (1/2) * Sum_{k=0..n} (binomial(n,k) * binomial(n+k,k+1))^2 for n >= 0.at n=4A277060
- Number of nX3 0..2 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A279802
- Number of nX4 0..2 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A279803
- T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=17A279805
- T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=18A279805
- Wiener index of the n X n black bishop graph.at n=16A292051
- L.g.f.: Sum_{n=-oo..+oo} (x - x^(2*n-1))^(2*n-1) / (2*n-1).at n=62A293129