List of integer sequences with links to LODA programs.

  • A300048 (program): G.f. A(x) satisfies: A(x)^3 = 1 + x*A(x) + x*A(x)^2 + x*A(x)^6.
  • A300061 (program): Heinz numbers of integer partitions of even numbers.
  • A300063 (program): Heinz numbers of integer partitions of odd numbers.
  • A300066 (program): Number of factorizations of the length-n prefix of the Fibonacci word A003849 into a (not strictly) decreasing sequence of finite Fibonacci words.
  • A300067 (program): Period 6: repeat [0, 0, 0, 1, 2, 2].
  • A300068 (program): A sequence based on the period 6 sequence A300067.
  • A300069 (program): Period 6: repeat [0, 0, 0, 1, 2, 1].
  • A300070 (program): Decimal expansion of the positive member y of a triple (x, y, z) solving a certain historical system of three equations.
  • A300071 (program): Decimal expansion of the member z of a triple (x, y, z) solving a certain historical system of three equations with positive y.
  • A300072 (program): Decimal expansion of the positive member -y of a triple (x, y, z) solving a certain historical system of three equations.
  • A300073 (program): Decimal expansion of the member z of a triple (x, y, z) satisfying a certain historical system of three equations with negative y.
  • A300074 (program): Decimal expansion of 1/(2*sin(Pi/5)) = A121570/2.
  • A300075 (program): Period 6: repeat [0, 1, 1, 2, 2, 2].
  • A300076 (program): A sequence based on the period 6 sequence A300075.
  • A300077 (program): Decimal expansion of Pi/2 truncated to n places.
  • A300116 (program): a(n) = Sum_{k=0..n} binomial(2k,k)^3 * binomial(2n-2k,n-k) * 2^(4*(n-k)).
  • A300126 (program): Number of Motzkin trees that are “uniquely closable skeletons”.
  • A300147 (program): a(n) = (1/8) * Sum_{d|n} d * A110163(d).
  • A300154 (program): Consider a spiral on an infinite hexagonal grid. a(n) is the number of cells in the part of the spiral from 1st to n-th cell that are on the same column or diagonal (in any of three directions) as the n-th cell along the spiral, including that cell itself.
  • A300159 (program): Number of ways of converting one set of lists containing n elements to another set of lists containing n elements by removing the last element from one of the lists and either appending it to an existing list or treating it as a new list.
  • A300164 (program): Numbers of the form n^2+1 not expressible as j^2+k^2 with j>k>1.
  • A300177 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
  • A300222 (program): In ternary (base-3) representation of n, replace 1’s with 0’s.
  • A300244 (program): Difference between A005187 and its Möbius transform (A297111).
  • A300251 (program): Möbius transform of arithmetic derivative (A003415).
  • A300252 (program): Difference between arithmetic derivative (A003415) and its Möbius transform (A300251).
  • A300253 (program): GCD of arithmetic derivative (A003415) and its Möbius transform (A300251).
  • A300254 (program): a(n) = 25*(n + 1)*(4*n + 3)*(5*n + 4)/3.
  • A300270 (program): a(n) = Sum_{1 <= i <= j <= n} mu(i*j)*floor((n/i)/j)).
  • A300287 (program): a(n) = floor((1/n) * Sum_{k=1..n} sqrt(k)).
  • A300290 (program): Period 6: repeat [0, 1, 2, 2, 3, 3].
  • A300291 (program): Triangle T read by rows: T is used to obtain the denominators of all fractional values for x = cos(phi) and y = sin(phi) with (x, y) on the unit circle for 0 < phi < Pi/2.
  • A300293 (program): A sequence based on the period 6 sequence A151899.
  • A300294 (program): Irregular triangle giving the GCD characteristic: t(n, m) = 1 if gcd(n, m) = 1 and zero otherwise, with t(1, 1) = 1 and t(n, m) for n >= 2 and m = 1..(n-1).
  • A300295 (program): Denominator of (1/3)*n*(n + 2)/((1 + 2*n)*(3 + 2*n)).
  • A300296 (program): Numerators of n*(5 + 3*n)/(8*(1 + 3*n)*(4 + 3*n)), n >= 0.
  • A300298 (program): Numerators of r(n) := Sum_{k=0..n-1} 1/Product_{j=0..4} (k + j + 1), for n >= 0, with r(0) = 0.
  • A300299 (program): Denominators of r(n) := Sum_{k=0..n-1} 1/Product_{j=0..4} (k + j + 1), for n >= 0, with r(0) = 0.
  • A300303 (program): Squares that are not of the form x^2 + x*y + y^2, where x and y are positive integers.
  • A300326 (program): Sum of the largest possible permutations that can be written without repetition of digits in each base from binary to n+1.
  • A300329 (program): Number of solutions to +-1 +- 2 +- 3 +- … +- n == n-1 (mod n).
  • A300330 (program): a(n) is the product over all prime powers p^e where p^e is the highest power of p dividing n and p-1 does not divide n.
  • A300344 (program): Number of n X 2 0..1 arrays with every element equal to 1 or 2 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A300401 (program): Array T(n,k) = n*(binomial(k, 2) + 1) + k*(binomial(n, 2) + 1) read by antidiagonals.
  • A300402 (program): Smallest integer i such that TREE(i) >= n.
  • A300403 (program): Smallest integer i such that SSCG(i) >= n.
  • A300404 (program): Smallest integer k such that the largest term in the Goodstein sequence starting at k is > n.
  • A300409 (program): Number of centered triangular numbers dividing n.
  • A300410 (program): Number of centered square numbers dividing n.
  • A300415 (program): Expansion of Product_{k>=2} (1 + x^k)/(1 - x^k).
  • A300421 (program): Number of n X 2 0..1 arrays with every element equal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A300438 (program): Expansion of (1+x)^3/(1-x-2*x^2-x^3+x^4).
  • A300451 (program): a(n) = (3*n^2 - 3*n + 8)*2^(n - 3).
  • A300474 (program): Number of partitions of the square resulting from a sequence of n n-sections, each of which divides any part perpendicular to any of the axes.
  • A300482 (program): a(n) = 2 * Integral_{t>=0} T_n(t/2) * exp(-t) * dt, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.
  • A300483 (program): a(n) = 2 * Integral_{t>=0} T_n((t+1)/2) * exp(-t) * dt, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.
  • A300484 (program): a(n) = 2 * Integral_{t>=0} T_n(t/2+1) * exp(-t) * dt, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.
  • A300485 (program): a(n) = 2 * Integral_{t>=0} T_n((t-1)/2) * exp(-t) * dt, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.
  • A300488 (program): a(n) = n! * [x^n] -exp(n*x)*log(1 - x)/(1 - x).
  • A300489 (program): a(n) = n! * [x^n] -log(1 - x)/(1 - n*x).
  • A300490 (program): Expansion of e.g.f. -exp(-x)*log(1 - x)/(1 - x).
  • A300500 (program): Number of nX2 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A300518 (program): The greatest prime factor of the squarefree part of n, or 1 if n is square.
  • A300519 (program): Convolution of n! and n^n.
  • A300521 (program): Expansion of Product_{k>=1} (1 - x^prime(k))^prime(k).
  • A300522 (program): a(n) = (5*n + 3)*(5*n + 4)*(5*n + 5)/6.
  • A300523 (program): a(n) = (5*n + 5)*(5*n + 6)*(5*n + 7)/6.
  • A300533 (program): Number of nX2 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A300559 (program): a(n) = n*(n+1)!/2 + 1.
  • A300570 (program): a(n) is the concatenation n in base 2, n-1 in base 2, …, 1 in base 2.
  • A300571 (program): a(n) is the concatenation n in base 2, n-1 in base 2, …, 0 in base 2.
  • A300576 (program): Number of nights required in the worst case to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).
  • A300581 (program): Expansion of Product_{k>=1} 1/(1 - 2^(k+1)*x^k).
  • A300583 (program): Expansion of Product_{k>=1} 1 / (1 - 2*3^k*x^k)).
  • A300613 (program): Number of partitions of the n-dimensional hypercube resulting from a sequence of n n-sections, each of which divides any part perpendicular to any of the axes.
  • A300622 (program): Denominators of sequence whose exponential self-convolution yields sequence 1, 2, 3, 5, 7, 11, 13, … (1 with primes).
  • A300624 (program): Figurate numbers based on the 11-dimensional regular convex polytope called the 11-dimensional cross-polytope, or 11-dimensional hyperoctahedron.
  • A300656 (program): Triangle read by rows: T(n,k) = 30*k^2*(n-k)^2 + 1; n >= 0, 0 <= k <= n.
  • A300657 (program): a(n) = Sum_{d|n} sigma(d) mod d.
  • A300659 (program): Product of digits of n!.
  • A300662 (program): Expansion of 1/(1 - x - Sum_{k>=2} prime(k-1)*x^k).
  • A300663 (program): Expansion of 1/(1 - Sum_{k>=1} mu(k)*x^k), where mu() is the Moebius function (A008683).
  • A300668 (program): a(n) = A000016(2*n).
  • A300671 (program): Expansion of 1/(1 - Sum_{k>=1} x^prime(k)/(1 - x^prime(k))).
  • A300672 (program): Expansion of 1/(1 - Sum_{p prime, k>=1} x^(p^k)/(1 - x^(p^k))).
  • A300707 (program): Decimal expansion of Pi^4/96.
  • A300709 (program): Decimal expansion of Pi^6/960.
  • A300711 (program): a(n) = A000367(n)/A001067(n).
  • A300717 (program): Möbius transform of A003557, n divided by its largest squarefree divisor.
  • A300718 (program): Möbius transform of A010848, number of numbers k <= n such that at least one prime factor of n is not a prime factor of k.
  • A300719 (program): Difference between A003557 (n divided by largest squarefree divisor of n) and its Möbius transform.
  • A300720 (program): Difference between A010848 and its Möbius transform.
  • A300738 (program): Number of minimal total dominating sets in the n-cycle graph.
  • A300757 (program): Number of {0,1} n X n matrices with at least one zero row or column.
  • A300758 (program): a(n) = 2n*(n+1)*(2n+1).
  • A300763 (program): a(n) = ceiling(n/g^3), where g = (1+sqrt(5))/2 is the golden ratio.
  • A300778 (program): Number of grid points visible from a corner of an m X n rectangular region on a square grid written as triangle T(m,n), 1 <= n <= m.
  • A300786 (program): L.g.f.: log(Product_{k>=1} (1 + k*x^k)) = Sum_{n>=1} a(n)*x^n/n.
  • A300793 (program): a(n) is the n-th derivative of arcsinh(1/x) at x=1 times (-2)^n/sqrt(2) for n >= 1.
  • A300799 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A300820 (program): Length of the longest sequence of consecutive primes in the prime factorization of n. a(1) = 0.
  • A300826 (program): a(n) = n/A125746(n), where A125746(n) gives the smallest divisor d of n such that the sum which includes d and all smaller divisors is >= n.
  • A300828 (program): Multiplicative with a(p^2) = 1, a(p^3) = -2 and a(p^e) = 0 when e = 1 or e > 3.
  • A300836 (program): a(n) is the total number of terms (1-digits) in Zeckendorf representation of all proper divisors of n.
  • A300837 (program): a(n) is the total number of terms (1-digits) in Zeckendorf representation of all divisors of n.
  • A300838 (program): Permutation of nonnegative integers: a(n) = A057300(A003188(n)).
  • A300839 (program): Permutation of nonnegative integers: a(n) = A006068(A057300(n)).
  • A300843 (program): Number of 4-cycles in the n-transposition graph.
  • A300846 (program): a(n) = 3*(n - 1)^2*n^3.
  • A300847 (program): a(n) = 12*binomial(n, 5).
  • A300850 (program): Number of 6-cycles in the n-odd graph.
  • A300853 (program): L.g.f.: log(Product_{k>=1} (1 + x^(k^2))) = Sum_{n>=1} a(n)*x^n/n.
  • A300867 (program): a(n) is the least positive k such that k * n is a Fibbinary number (A003714).
  • A300889 (program): a(n) is the least positive multiple of n which is a Fibbinary number (A003714).
  • A300894 (program): L.g.f.: log(Product_{k>=1} (1 + mu(k)^2*x^k)) = Sum_{n>=1} a(n)*x^n/n, where mu() is the Moebius function (A008683).
  • A300902 (program): a(n) = n! / Product_{p prime < n}.
  • A300912 (program): Numbers of the form prime(x)*prime(y) where x and y are relatively prime.
  • A300915 (program): Order of the group PSL(2,Z_n).
  • A300950 (program): Fixed points of A300948.
  • A300951 (program): a(n) = Product_{j=1..floor(n/2)} p(j) where p(j) = j if j is prime else 1.
  • A300975 (program): a(n) = [x^n] Product_{k>=1} 1/(1 - x^(k^3))^n.
  • A300999 (program): Add to a(n) the first digit of a(n+1) to get a(n+2), with a(1) = 1 and a(2) = 2.
  • A301270 (program): Number of labeled trees on n vertices containing two fixed non-adjacent edges.
  • A301271 (program): Expansion of (1-16*x)^(1/8).
  • A301272 (program): Number of derangements of S_n with exactly one peak.
  • A301273 (program): Numerator of mean of first n primes.
  • A301277 (program): Nearest integer to mean of first n primes.
  • A301291 (program): Expansion of (x^4+3*x^3+x^2+3*x+1) / ((x^2+1)*(x-1)^2).
  • A301292 (program): Partial sums of A301291.
  • A301293 (program): Expansion of (x^2+x+1)^2 / ((x^2+1)*(x-1)^2).
  • A301294 (program): Partial sums of A301293.
  • A301297 (program): Distance from n to nearest Catalan number.
  • A301298 (program): Expansion of (1 + 4*x + 4*x^2 + 4*x^3 + x^4)/((1 - x)*(1 - x^3)).
  • A301299 (program): Coordination sequence for node of type V1 in “krq” 2-D tiling (or net).
  • A301300 (program): Partial sums of A301299.
  • A301306 (program): G.f.: Sum_{n>=0} (1 + (1+x)^n)^n * x^n.
  • A301316 (program): a(n) = ((n-1)! + 1) mod n^2.
  • A301317 (program): a(n) = (n-1)! + 1 mod n^3.
  • A301318 (program): a(n) = sqrt(A299921(n)).
  • A301336 (program): a(n) = total number of 1’s minus total number of 0’s in binary expansions of 0, …, n.
  • A301337 (program): Number of steps required in the worst case for two knights to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).
  • A301347 (program): a(n) = n^(n-1) + (n-1)!.
  • A301370 (program): Maximum determinant of an n X n (0,1)-matrix that has exactly 2*n ones.
  • A301378 (program): a(n) = 10*A007605(n) - 9*A007652(n).
  • A301383 (program): Expansion of (1 + 3*x - 2*x^2)/(1 - 7*x + 7*x^2 - x^3).
  • A301402 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A301417 (program): Sums of positive coefficients in generalized Chebyshev polynomials of the first kind, for a family of 4 data.
  • A301420 (program): Sums of positive coefficients in generalized Chebyshev polynomials of the first kind, for a family of 5 data.
  • A301421 (program): Sums of positive coefficients of generalized Chebyshev polynomials of the first kind, for a family of 6 data.
  • A301424 (program): Sums of positive coefficients of generalized Chebyshev polynomials of the first kind, for a family of 7 data.
  • A301426 (program): Number of steps required in the worst case for three knights to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).
  • A301438 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A301451 (program): Numbers congruent to {1, 7} mod 9.
  • A301454 (program): Number of strictly log-concave permutations of {1,…,n}.
  • A301458 (program): a(n) = [x^n] Product_{k>=1} 1/(1 - x^(k*(k+1)/2))^n.
  • A301461 (program): Number of integers less than or equal to n whose largest prime factor is 3.
  • A301466 (program): a(n) = Sum_{k>=0} binomial(k^3, n)/2^(k+1).
  • A301468 (program): a(n) = Sum_{k>=0} binomial(k^4, n)/2^(k+1).
  • A301476 (program): Expansion of (sqrt(8*x^2 - 4*x + 1)*(1 - 4*x))^(-1).
  • A301477 (program): T(n,k) = Sum_{j=0..n-k} H(n,j)*2^k with H(n,k) = binomial(n,k)* hypergeom([-k/2, 1/2-k/2], [2-k+n], 4), for 0 <= k <= n, triangle read by rows.
  • A301483 (program): a(n) = floor(a(n-1)/(2^(1/3)-1) with a(1)=1.
  • A301484 (program): Decimal expansion of J_0(2)/J_1(2) = 1 - 1/(2 - 1/(3 - 1/(4 - …))).
  • A301500 (program): Number of compositions (ordered partitions) of n into squarefree parts (A005117) such that no two adjacent parts are equal (Carlitz compositions).
  • A301501 (program): Number of compositions (ordered partitions) of n into prime power parts (A246655) such that no two adjacent parts are equal (Carlitz compositions).
  • A301502 (program): Number of compositions (ordered partitions) of n into triangular parts (A000217) such that no two adjacent parts are equal (Carlitz compositions).
  • A301503 (program): Number of compositions (ordered partitions) of n into square parts (A000290) such that no two adjacent parts are equal (Carlitz compositions).
  • A301516 (program): Numbers n with decimal expansion (d_1, …, d_k) such that the convex hull of the set of points { (i, d_i), i = 1..k } has positive area.
  • A301523 (program): Integers which can be partitioned into two distinct factorials. 0! and 1! are not considered distinct.
  • A301560 (program): Matching number of the n-odd graph.
  • A301571 (program): Number of vertices at distance 2 from a given vertex in the n-Keller graph.
  • A301587 (program): Positive integers m such that whenever n is in the range of the Euler totient function, so is m*n.
  • A301593 (program): n can be represented the sum of a(n) distinct factorials. (If there is no such representation, a(n) = 0.)
  • A301600 (program): a(n) = Primorial(n) / Product_{k prime<n} k.
  • A301601 (program): Numbers k such that k^6 can be written as a sum of 11 positive 6th powers.
  • A301616 (program): a(n) = Product_{k=1..n} (k^2+(n-k+1)^2).
  • A301617 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 1.
  • A301619 (program): Primes congruent to 65 (mod 192).
  • A301621 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 2.
  • A301622 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 4.
  • A301623 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 5.
  • A301628 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 7.
  • A301631 (program): Numerator of population variance of n-th row of Pascal’s triangle.
  • A301647 (program): a(n) = n^3 - (n mod 2).
  • A301653 (program): Expansion of x*(1 + 2*x)/((1 - x)*(1 + x)*(1 - x - x^2)).
  • A301654 (program): Circumference of the n-triangular honeycomb acute knight graph.
  • A301657 (program): Number of nX3 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.
  • A301658 (program): Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or vertically adjacent elements, with upper left element zero.
  • A301672 (program): Coordination sequence for node of type V2 in “krr” 2-D tiling (or net).
  • A301673 (program): Partial sums of A301672.
  • A301676 (program): Coordination sequence for node of type V2 in “krs” 2-D tiling (or net).
  • A301677 (program): Partial sums of A301676.
  • A301682 (program): Coordination sequence for node of type V1 in “krg” 2-D tiling (or net).
  • A301683 (program): Partial sums of A301682.
  • A301684 (program): Coordination sequence for node of type V2 in “krg” 2-D tiling (or net).
  • A301685 (program): Partial sums of A301684.
  • A301686 (program): Coordination sequence for node of type V1 in “krh” 2-D tiling (or net).
  • A301687 (program): Partial sums of A301686.
  • A301688 (program): Coordination sequence for node of type V2 in “krh” 2-D tiling (or net).
  • A301689 (program): Partial sums of A301688.
  • A301694 (program): Expansion of (1 + 5*x + 4*x^2 + 5*x^3 + x^4)/((1 - x)*(1 - x^3)).
  • A301695 (program): Expansion of (1 + 5*x + 4*x^2 + 5*x^3 + x^4)/((1 - x)^2*(1 - x^3)).
  • A301696 (program): Partial sums of A219529.
  • A301697 (program): Coordination sequence for node of type V2 in “krj” 2-D tiling (or net).
  • A301698 (program): Partial sums of A301697.
  • A301699 (program): Generating function = g(g(x)), where g(x) = g.f. of Jacobsthal numbers A001045.
  • A301702 (program): a(n) = [x^n] Product_{k>=0} 1/(1 - x^(2^k))^n.
  • A301707 (program): a(n) = n * Sum_{k prime<=n} k.
  • A301708 (program): Coordination sequence for node of type V1 in “krc” 2-D tiling (or net).
  • A301709 (program): Partial sums of A301708.
  • A301710 (program): Coordination sequence for node of type V2 in “krc” 2-D tiling (or net).
  • A301711 (program): Partial sums of A301710.
  • A301712 (program): Coordination sequence for node of type V1 in “usm” 2-D tiling (or net).
  • A301713 (program): Partial sums of A301712.
  • A301714 (program): Coordination sequence for node of type V2 in “usm” 2-D tiling (or net).
  • A301715 (program): Partial sums of A301714.
  • A301716 (program): Coordination sequence for node of type V1 in “kre” 2-D tiling (or net).
  • A301717 (program): Partial sums of A301716.
  • A301718 (program): Coordination sequence for node of type V2 in “kre” 2-D tiling (or net).
  • A301719 (program): Partial sums of A301718.
  • A301720 (program): Coordination sequence for node of type V1 in “krb” 2-D tiling (or net).
  • A301721 (program): Partial sums of A301720.
  • A301722 (program): Coordination sequence for node of type V2 in “krb” 2-D tiling (or net).
  • A301723 (program): Partial sums of A301722.
  • A301724 (program): Coordination sequence for node of type V1 in “kra” 2-D tiling (or net).
  • A301725 (program): Partial sums of A301724.
  • A301726 (program): Coordination sequence for node of type V2 in “kra” 2-D tiling (or net).
  • A301727 (program): Partial sums of A301726.
  • A301728 (program): a(0)=1; thereafter, a(n) = 2n-1 if n == 0 (mod 3), (5n+1)/3 if n == 1 (mod 3), (5n+2)/3 if n == 2 (mod 3).
  • A301729 (program): a(0)=1; thereafter positive numbers that are congruent to {0, 1, 3, 5} mod 6.
  • A301730 (program): Expansion of (x^8-x^7+x^6+5*x^5+4*x^4+3*x^3+5*x^2+5*x+1)/(x^6-x^5-x+1).
  • A301739 (program): The number of trees with 4 nodes labeled by positive integers, where each tree’s label sum is n.
  • A301741 (program): a(n) = n! * [x^n] exp((n + 1)*x + x^2/2).
  • A301747 (program): Expansion of Product_{k>=1} (1/(1 - x^k))^(sigma_0(k)^2).
  • A301752 (program): Clique covering number of the n-triangular grid graph.
  • A301755 (program): Decimal expansion of 3/8.
  • A301758 (program): Clique covering number of the n X n fiveleaper graph.
  • A301764 (program): Number of ways to choose a constant rooted partition of each part in a constant rooted partition of n such that the flattened sequence is also constant.
  • A301772 (program): Number of odd chordless cycles in the n-antiprism graph.
  • A301773 (program): Number of odd chordless cycles in the 2n-Moebius ladder graph.
  • A301774 (program): Number of odd chordless cycles in the (2n+1)-prism graph.
  • A301775 (program): Number of odd chordless cycles in the (2n+1)-web graph.
  • A301779 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.
  • A301786 (program): Number of nX4 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301787 (program): Number of nX5 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301788 (program): Number of nX6 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301789 (program): Number of n X 7 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301791 (program): Number of 2Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301792 (program): Number of 3Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301797 (program): a(n) = (4^prime(n) - 1)/3.
  • A301809 (program): Group the natural numbers such that the first group is (1) then (2),(3),(4,5),(6,7,8),… with the n-th group containing F(n) sequential terms where F(n) is the n-th Fibonacci number (A000045(n)). Sequence gives the sum of terms in the n-th group.
  • A301812 (program): Numbers of the form p^2 - 1 where p is a prime of the form 3*k-1 (A003627).
  • A301819 (program): Number of nX4 0..1 arrays with every element equal to 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301836 (program): Number of n X 3 0..1 arrays with every element equal to 0, 1 or 2 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301848 (program): Number of states generated by morphism during inflation stage of paper-folding sequence.
  • A301849 (program): The Pagoda sequence: a sequence with isolated zeros in number-wall over finite fields.
  • A301862 (program): Decimal expansion of the probability of intersection of 2 random chords in a circle, where each chord is selected by a random point within the circle and a random direction.
  • A301875 (program): Expansion of Product_{k>=1} 1/(1 - x^k)^A007434(k).
  • A301877 (program): Group the natural numbers into groups (1),(2),(3),(4),(5,6),(7,8,9),… so that the n-th group contains N(n) terms, where N(n) is the Narayana’s cows sequence (A000930). Sequence contains the sum of the terms in the n-th group.
  • A301879 (program): Number of nX3 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301885 (program): Number of 2Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301895 (program): a(n) = (number of 1’s in binary expansion of n)^(number of 0’s in binary expansion of n).
  • A301898 (program): a(n) = (2*n + 1)! if n is even, a(n) = 2*(2*n + 1)! if n is odd.
  • A301902 (program): Number of n X 3 0..1 arrays with every element equal to 0, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301917 (program): a(n) is the least k for which A301916(n) divides 3^k + 1.
  • A301919 (program): a(n) is the least value of k for which A301918(n) divides 3^k+3.
  • A301926 (program): a(n+3) = a(n) + 24*n + 32, a(0)=0, a(1)=3, a(2)=13.
  • A301941 (program): a(n) is the smallest positive integer k such that n + k divides n^2 + k, or 0 if no such k exists.
  • A301946 (program): Number of nX3 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301959 (program): Number of nX3 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301960 (program): Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301965 (program): Number of 3Xn 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301972 (program): a(n) = n*(n^2 - 2*n + 4)*binomial(2*n,n)/((n + 1)*(n + 2)).
  • A301973 (program): a(n) = (n^2 - 3*n + 6)*binomial(n+2,3)/4.
  • A301975 (program): Numbers whose abundance is divisible by its number of divisors.
  • A301977 (program): a(n) is the number of distinct positive numbers whose binary digits appear in order but not necessarily as consecutive digits in the binary representation of n.
  • A301985 (program): a(n) = n^2 + 2329n + 1697.
  • A301990 (program): a(n) = 8*(n-1)*a(n-1) + Product_{k=0..n-2} (2*k-1) with a(1) = 1.
  • A301992 (program): a(n) = 8*(n-2)*(2*n-5)*a(n-1) + ((n-2)/9)*Product_{k=0..n-2} (2*k-3)^2 with a(1) = 0.
  • A301994 (program): Number of n X 3 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A301995 (program): Number of nX4 0..1 arrays with every element equal to 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A302006 (program): Number of nX4 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A302017 (program): Expansion of 1/(1 - x*Product_{k>=1} (1 + x^(2*k-1))).
  • A302018 (program): Expansion of 1/(1 - x*(1 + theta_3(x))/2), where theta_3() is the Jacobi theta function.
  • A302019 (program): Expansion of 1/(1 - x*Sum_{k>=0} x^(k^3)).
  • A302020 (program): Expansion of 1/(1 - x*Product_{k>=1} (1 + x^(2*k))/(1 - x^(2*k-1))).
  • A302028 (program): Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A057889(A057889(n)-1), where A057889 is a bijective bit-reverse.
  • A302033 (program): a(n) = A019565(A003188(n)).
  • A302047 (program): a(n) = 1 if n = prime(k)*prime(2+k) for some k, otherwise 0.
  • A302048 (program): a(n) = 1 if n = p^2 for some prime p, otherwise 0. Characteristic function of squares of primes (A001248).
  • A302049 (program): a(n) = 1 if n = prime(k)*prime(1+k) for some k, otherwise 0.
  • A302054 (program): a(n) is the sum of prime divisors of A302033(n).
  • A302056 (program): Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1 - x^j)^4 is zero.
  • A302058 (program): Numbers that are not square pyramidal numbers.
  • A302064 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A302076 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A302092 (program): Product of n-th Bell number and n-th Bell number written backwards.
  • A302110 (program): Let d be the list of A000005(n) = tau(n) divisors of n. Then a(n) is the largest k such that Sum_{i=1..#d-k} d_i > n.
  • A302113 (program): a(n) = (4/(2*n-3))*(2*(n-1)*(2*n-1)*a(n-1) + (-1)^n*Product_{k=0..n-1} (2*k+1)) with a(0) = 0.
  • A302114 (program): a(n) = 8*(n-1)*(2*n-3)*a(n-1) + ((-1)^n)*(n-1)*Product_{k=0..n-3} (2*k+1)^2 with a(0) = 0.
  • A302115 (program): a(n) = 16*(n-1)*a(n-1) + ((-1)^n)*(4/3)*Product_{k=0..n-1} (2*k-3) with a(0) = 0.
  • A302116 (program): a(n) = 16*(n-1)*((2*n-3)*a(n-1) + (((-1)^n)/9)*Product_{k=0..n-1} (2*k-3)^2) with a(0) = 0.
  • A302117 (program): a(n) = 4*(n-1)*a(n-1) - (1/3)*Product_{k=0..n-1} (2*k-3), with a(0) = 0.
  • A302126 (program): Interleaved Fibonacci and Lucas numbers.
  • A302129 (program): Number of unlabeled uniform connected hypergraphs of weight n.
  • A302138 (program): Period of Kronecker symbol modulo n.
  • A302141 (program): Multiplicative order of 16 mod 2n+1.
  • A302146 (program): Number of nX3 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
  • A302156 (program): a(n) = Product_{k=1..n} prime(k+1)^(n-k+1).
  • A302165 (program): Number of 3Xn 0..1 arrays with every element equal to 0, 1 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302178 (program): The number of 3D walks of semilength n in a quadrant returning to the origin.
  • A302180 (program): Number of 3D walks of type aad.
  • A302181 (program): Number of 3D walks of type abb.
  • A302183 (program): Number of 3D walks of type abd.
  • A302184 (program): Number of 3D walks of type abe.
  • A302186 (program): Number of 3D walks of type ace.
  • A302188 (program): Number of 3D walks of type bce.
  • A302189 (program): Hurwitz inverse of squares [1,4,9,16,…].
  • A302190 (program): Hurwitz logarithm of natural numbers 1,2,3,4,5,…
  • A302195 (program): Hurwitz inverse of triangular numbers [1,3,6,10,15,…].
  • A302203 (program): a(n) = floor(sin(n)) + 1.
  • A302231 (program): Number of pairs of Goldbach partitions of 2n, (p,q) and (s,t) with p < s <= t < q such that s = p + 2 and t = q - 2.
  • A302234 (program): Expansion of Product_{k>=1} (1 - x^k)/(1 - x^prime(k)).
  • A302240 (program): Triangle T(n,k) of the numbers of k-matchings in the n-pan graph (0 <= k <= ceiling(n/2).
  • A302242 (program): Total weight of the n-th multiset multisystem. Totally additive with a(prime(n)) = Omega(n).
  • A302243 (program): Total weight of the n-th twice-odd-factored multiset partition.
  • A302245 (program): Maximum remainder of p*q divided by p+q with 0 < p <= q <= n.
  • A302253 (program): Positions of 3 in A190436.
  • A302254 (program): Exponent of the group of the Gaussian integers in a reduced system modulo (1+i)^n.
  • A302255 (program): Total domination number of the n-antiprism graph.
  • A302266 (program): Number of 2Xn 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302279 (program): Number of 2 X n 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302286 (program): a(n) = [x^n] 1/(1 - n*x - x/(1 - n*x - x/(1 - n*x - x/(1 - n*x - x/(1 - …))))), a continued fraction.
  • A302298 (program): Wiener index of the graph of nodes (i,j) of the square lattice such that abs(i) + abs(j) <= n.
  • A302302 (program): Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.
  • A302323 (program): Number of 2Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302329 (program): a(0)=1, a(1)=61; for n>1, a(n) = 62*a(n-1) - a(n-2).
  • A302330 (program): a(0)=1, a(1)=97; for n>1, a(n) = 98*a(n-1) - a(n-2).
  • A302331 (program): a(0)=1, a(1)=141; for n>1, a(n) = 142*a(n-1) - a(n-2).
  • A302332 (program): a(0)=1, a(1)=193; for n>1, a(n) = 194*a(n-1) - a(n-2).
  • A302334 (program): A weighted smoothing applied to the primes as a data set: a(n) = floor(A007443(2n-1)/2^(2n-2)), where A007443 is binomial transform of primes.
  • A302338 (program): a(n) = 3*n + 2^v(n) where v(n) denotes the 2-adic valuation of n.
  • A302339 (program): Triangle read by rows: T(n,k) = number of linear operators T on an n-dimensional vector space over GF(2) such that U is invariant under T for some given k-dimensional subspace U.
  • A302341 (program): Triameter of the n X n knight graph.
  • A302342 (program): Cumulative sums of the bits in the binary representation of Pi.
  • A302352 (program): a(n) = Sum_{k=0..n} k^4*binomial(2*n-k,n).
  • A302353 (program): a(n) = Sum_{k=0..n} k^n*binomial(2*n-k,n).
  • A302354 (program): Expansion of (Sum_{i>=1} x^prime(i))*(Sum_{j>=0} x^(j^3)).
  • A302368 (program): Number of 2Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302390 (program): Triameter of the n-cube-connected cycle graph.
  • A302391 (program): Number of partitions of 2n into two parts with at least one nonsquarefree part.
  • A302392 (program): Number of odd parts in the partitions of 3n into 3 parts.
  • A302393 (program): Number of even parts in the partitions of 3n into 3 parts.
  • A302397 (program): Expansion of e.g.f. 1/(1 + x*exp(x)).
  • A302398 (program): a(n) = n! * [x^n] 1/(1 + x*exp(n*x)).
  • A302402 (program): Total domination number of the n-ladder graph.
  • A302404 (program): Total domination number of the n-Moebius ladder.
  • A302405 (program): Total domination number of the n-prism graph.
  • A302406 (program): Total domination number of the n X n torus grid graph.
  • A302433 (program): a(n) is the sum of the nonmiddle divisors of n.
  • A302436 (program): a(n) is the number of ways of writing the binary expansion of n as a concatenation of nonempty substrings with Hamming weight at most 1.
  • A302445 (program): Triangle read by rows: row n gives primes of form k^2 + n - k for 0 < k < n.
  • A302451 (program): a(n) = [x^n] Product_{k>=0} (1 + n*x^(2^k)).
  • A302479 (program): Number of partitions of n into two distinct nonprime parts.
  • A302480 (program): Number of partitions of n into two parts with the smaller part nonprime and the larger part prime.
  • A302481 (program): Number of partitions of n into two parts with the smaller part prime and the larger part nonprime.
  • A302483 (program): Number of FF-equivalence classes of Łukasiewicz paths. Łukasiewicz paths are P-equivalent iff the positions of pattern P are identical in these paths.
  • A302488 (program): Total domination number of the n X n grid graph.
  • A302491 (program): Prime numbers of squarefree index.
  • A302493 (program): Prime numbers of prime-power index.
  • A302505 (program): Numbers whose prime indices are squarefree and have disjoint prime indices.
  • A302506 (program): Number of total dominating sets in the n-pan graph.
  • A302507 (program): a(n) = 4*(3^n-1).
  • A302521 (program): Odd numbers whose prime indices are squarefree and have disjoint prime indices. Numbers n such that the n-th multiset multisystem is a set partition.
  • A302534 (program): Squarefree numbers whose prime indices are also squarefree and have disjoint prime indices.
  • A302537 (program): a(n) = (n^2 + 13*n + 2)/2.
  • A302542 (program): Expansion of e.g.f. arctan(x)/cos(x) (odd powers only).
  • A302543 (program): Expansion of e.g.f. arctanh(x)/cos(x) (odd powers only).
  • A302546 (program): a(n) = Sum_{k = 1…n} 2^binomial(n, k).
  • A302549 (program): Expansion of Sum_{k>=1} (-1 + Product_{j>=1} 1/(1 - x^(k*j))^j).
  • A302550 (program): Expansion of Sum_{k>=1} (-1 + Product_{j>=1} (1 + x^(k*j))^j).
  • A302553 (program): Hyper-4 powers that are not hyper-5 powers.
  • A302557 (program): Expansion of 1/(2 - Sum_{k>=0} k!*x^k/(1 + x)^(k+1)).
  • A302560 (program): Partial sums of icosahedral numbers (A006564).
  • A302562 (program): Partial sums of A092181.
  • A302563 (program): Numbers whose digital root is equal to their number of digits.
  • A302564 (program): a(n) is the greatest prime p such that (2*n+1-p)/2 is prime.
  • A302576 (program): Numbers k such that k/10 + 1 is a square.
  • A302581 (program): a(n) = n! * [x^n] -exp(-n*x)*log(1 - x).
  • A302582 (program): a(n) = n! * [x^n] log(1 + x)/(1 - x)^n.
  • A302583 (program): a(n) = ((n + 1)^n - (n - 1)^n)/2.
  • A302584 (program): a(n) = n! * [x^n] exp(n*x)/cos(x).
  • A302585 (program): a(n) = n! * [x^n] exp(n*x)/cosh(x).
  • A302586 (program): a(n) = n! * [x^n] exp(n*x)*tan(x).
  • A302587 (program): a(n) = n! * [x^n] exp(n*x)*tanh(x).
  • A302588 (program): a(n) = a(n-3) + 7*(n-2), a(0)=1, a(1)=2, a(2)=4.
  • A302603 (program): Number of total dominating sets in the wheel graph on n nodes.
  • A302604 (program): Number of partitions of n into two parts such that the positive difference of the parts is squarefree.
  • A302608 (program): a(n) = n! * [x^n] exp(n*x)*arctan(x).
  • A302609 (program): a(n) = n! * [x^n] exp(n*x)*arctanh(x).
  • A302611 (program): Expansion of e.g.f. -log(1 - x)*arctanh(x).
  • A302612 (program): a(n) = (n+1)*(n^4-4*n^3+11*n^2-8*n+12)/12.
  • A302642 (program): Number of partitions of n into two parts such that the positive difference of the parts is semiprime.
  • A302643 (program): Number of partitions of n into two parts such that the positive difference of the parts is a squarefree semiprime.
  • A302647 (program): a(n) = (2*n^2*(n^2 - 3) - (2*n^2 + 1)*(-1)^n + 1)/64.
  • A302650 (program): Number of minimal total dominating sets in the n-barbell graph.
  • A302653 (program): Number of minimum total dominating sets in the n-cycle graph.
  • A302654 (program): Number of minimum total dominating sets in the n-path graph.
  • A302655 (program): Number of minimal total dominating sets in the n-path graph.
  • A302658 (program): Number of minimal total dominating sets in the wheel graph on n nodes.
  • A302660 (program): a(n) = (prime(n) mod 9) + (prime(n) mod 10).
  • A302675 (program): Number of nX3 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A302689 (program): a(n) = 4 + 2^n - 4*n.
  • A302697 (program): Odd numbers whose prime indices are relatively prime. Heinz numbers of integer partitions with no 1’s and with relatively prime parts.
  • A302707 (program): Number of factors of Chebyshev polynomial S(2*n+1, x) (A049310) over the integers. Factorization is into the minimal integer polynomials C (A187360).
  • A302709 (program): a(n) = Trinomial(2*n+1, 4) = (1/6)*n*(2*n + 1)*(2*n^2 + 9*n + 1), n >= 0.
  • A302710 (program): a(n) = trinomial(2*n, 4) = (1/6)*n*(2*n - 1)*(2*n^2 + 7*n - 3).
  • A302733 (program): a(n) = 4*n*(2*n-1)*a(n-1) + (4/9)*n*Product_{k=0..n} (2*k-3)^2, with a(0) = 0.
  • A302734 (program): Number of paths in the n-path complement graph.
  • A302747 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = -2*T(n-1,k) + 3*T(n-2,k-1) for 0 <= k <= floor(n/2); T(n,k)=0 for n or k < 0.
  • A302748 (program): Half thrice the previous number, rounded down, plus 1, starting with 6.
  • A302749 (program): Number of maximal matchings in the n-path complement graph.
  • A302750 (program): Number of maximum matchings in the n-path complement graph.
  • A302757 (program): a(n) is the smallest number whose greedy representation as a sum of terms of A126684 uses n terms.
  • A302758 (program): a(n) = n^2*(n*(4*n + 3) + 3*n*(-1)^n - 4)/96.
  • A302761 (program): Number of total dominating sets in the n-barbell graph.
  • A302764 (program): Pascal-like triangle with A000012 as the left border and A080956 as the right border.
  • A302766 (program): a(n) = n*((4*n + 1)*(7*n - 4) + 15*n*(-1)^n)/48.
  • A302769 (program): a(n) = 2*((2*n-1)*a(n-1) - (n-2)!), with a(1) = 4, n > 1.
  • A302770 (program): a(n) = (4*n-2)*((n-1)*a(n-1) + ((n-2)!)^2), with a(1) = 0, n > 1.
  • A302773 (program): Numerators of (3*n + 2)/12.
  • A302774 (program): a(n) is the position of the first term in A303762 that has prime(n) as one of its prime factors.
  • A302776 (program): a(1) = 1; for n>1, a(n) = n/(largest Fermi-Dirac factor of n).
  • A302777 (program): a(n) = 1 if n is of the form p^(2^k) where p is prime and k >= 0, otherwise 0.
  • A302778 (program): Number of “Fermi-Dirac primes” (A050376) <= n.
  • A302792 (program): a(1) = 1; for n>1, a(n) = n/(smallest Fermi-Dirac factor of n).
  • A302794 (program): Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A193231(A193231(n)-1), where A193231(n) is blue code of n.
  • A302826 (program): a(n) is number of primes of form k^2 + n - k for 0 < k < n.
  • A302829 (program): a(n) is the number of lattice points in a Cartesian grid between a circle of radius n and an inscribed square whose vertices lie on the coordinate axes.
  • A302830 (program): Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - k*x^k).
  • A302831 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 + k*x^k).
  • A302832 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 + x^k)^k.
  • A302833 (program): Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - x^(k^2)).
  • A302834 (program): Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - x^(k^3)).
  • A302835 (program): Expansion of (1/(1 - x))*Product_{k>=1} 1/(1 - x^(k*(k+1)/2)).
  • A302852 (program): Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A225901(A225901(n)-1))
  • A302855 (program): Expansion of ((1 + 2 * Sum_{k>=1} q^(k^2))^16 - 1) / 32.
  • A302856 (program): Number of ways of writing n as a sum of 32 squares.
  • A302857 (program): Expansion of ((1 + 2 * Sum_{k>=1} q^(k^2))^32 - 1) / 64.
  • A302860 (program): a(n) = [x^n] theta_3(x)^n/(1 - x), where theta_3() is the Jacobi theta function.
  • A302865 (program): a(n) = (4*n+2)*a(n-1) + (-1)^(n+1)*4*((n-1)!), with a(0) = 8, n > 0.
  • A302866 (program): a(n) = 2*(n*(2*n+1)*b(n-1) + (-1)^(n-1)*(2*n+1)*((n-1)!)^2), with a(0) = 0, n > 1.
  • A302906 (program): a(0) = 0; for n > 0, a(n) = a(n-1) + 5*n + 4.
  • A302909 (program): Determinant of n X n matrix whose main diagonal consists of the first n 5-gonal numbers and all other elements are 1’s.
  • A302910 (program): Determinant of n X n matrix whose main diagonal consists of the first n 6-gonal numbers and all other elements are 1’s.
  • A302911 (program): Determinant of n X n matrix whose main diagonal consists of the first n 7-gonal numbers and all other elements are 1’s.
  • A302912 (program): Determinant of n X n matrix whose main diagonal consists of the first n 8-gonal numbers and all other elements are 1’s.
  • A302913 (program): Determinant of n X n matrix whose main diagonal consists of the first n 9-gonal numbers and all other elements are 1’s.
  • A302914 (program): Determinant of n X n matrix whose main diagonal consists of the first n 10-gonal numbers and all other elements are 1’s.
  • A302918 (program): Number of nonequivalent minimal total dominating sets in the n-cycle graph up to rotation.
  • A302930 (program): Maximum number of 6’s possible in an infinite Minesweeper grid with n mines.
  • A302931 (program): Maximum number of 7’s possible in an infinite Minesweeper grid with n mines.
  • A302938 (program): Lexicographically first sequence of distinct terms such that the sum of any two terms is not a term of the sequence, and the sum of any two digits is not a digit of the sequence.
  • A302941 (program): Number of total dominating sets in the 2n-crossed prism graph.
  • A302942 (program): a(n) = (2^n-1)^2*(2^n + 2).
  • A302944 (program): a(n) = 4*((2*n-1)*a(n-1) + (-1)^n*(n-2)!), with a(1) = 8, n > 1.
  • A302945 (program): a(n) = 4*(2*n+1)(n*a(n-1) + (-1)^(n-1)*((n-1)!)^2), with a(0) = 0, n > 0.
  • A302946 (program): Number of minimal (and minimum) total dominating sets in the 2n-crossed prism graph.
  • A302974 (program): a(n) = numerator of tau(n)^n / n^tau(n).
  • A302975 (program): a(n) = denominator of tau(n)^n / n^tau(n).
  • A302976 (program): a(n) = tau(n)^n mod n^tau(n).
  • A302978 (program): Chromatic invariant of the n-path complement graph.
  • A302980 (program): Size of the smallest square Minesweeper grid that allows each number from 0 to 8 to appear exactly n times.
  • A302989 (program): a(n) = n^n + n*n + n.
  • A302999 (program): a(n) = Product_{k=1..n} (Fibonacci(k+2) - 1).
  • A303003 (program): Total domination number of the n X n queen graph.
  • A303005 (program): Number of dominating sets in the n-pan graph.
  • A303007 (program): Expansion of (1-240*x)^(1/8).
  • A303051 (program): Number of partitions of n into two distinct parts (p,q) such that p, q and p+q are all squarefree.
  • A303052 (program): Total area of all squares with squarefree side length |s - t|, such that n = s + t, and s < t, where s and t are positive integers.
  • A303054 (program): Number of minimum total dominating sets in the n-ladder graph.
  • A303055 (program): Expansion of (1-504*x)^(1/12).
  • A303070 (program): a(n) = [x^n] (1/(1 - x))*Product_{k>=1} 1/(1 - x^k)^n.
  • A303071 (program): a(n) = [x^n] (1/(1 - x))*Product_{k>=1} (1 + x^k)^n.
  • A303072 (program): Number of minimal total dominating sets in the n-ladder graph.
  • A303073 (program): L.g.f.: log(1 + Sum_{k>=1} prime(k)*x^k) = Sum_{n>=1} a(n)*x^n/n.
  • A303074 (program): Expansion of Product_{n>=1} (1 + (9*x)^n)^(1/3).
  • A303108 (program): a(n) = (2*n-1)*a(n-1) - (n-2)!, with a(1) = 2, n > 1.
  • A303109 (program): a(n) = n*(2*n-1)*a(n-1) + ((n-1)!)^2, with a(0) = 0, n > 0.
  • A303120 (program): Total area of all rectangles of size p X q such that p + q = n^2 and p <= q.
  • A303124 (program): Expansion of Product_{n>=1} (1 + (16*x)^n)^(1/4).
  • A303125 (program): Expansion of Product_{n>=1} (1 + (25*x)^n)^(1/5).
  • A303130 (program): Expansion of Product_{n>=1} (1 + (9*x)^n)^(-1/3).
  • A303131 (program): Expansion of Product_{n>=1} (1 + (16*x)^n)^(-1/4).
  • A303132 (program): Expansion of Product_{n>=1} (1 + (25*x)^n)^(-1/5).
  • A303135 (program): Expansion of Product_{n>=1} (1 - (16*x)^n)^(-1/4).
  • A303152 (program): Expansion of Product_{n>=1} (1 - (9*x)^n)^(1/3).
  • A303165 (program): Sum of the squarefree differences |q-p| of the parts in the partitions of n into two distinct parts (p,q) where p < q.
  • A303205 (program): Number of rectangles with squarefree area and dimensions p and |q-p| such that n = p + q and p < q.
  • A303211 (program): Number of minimum total dominating sets in the n X n rook graph.
  • A303212 (program): Number of minimum total dominating sets in the n X n rook complement graph.
  • A303221 (program): Total area of all rectangles with dimensions p and p + q such that p and q are both squarefree, n = p + q and p <= q.
  • A303222 (program): Total volume of all rectangular prisms with dimensions p, q and (p + q)/2 such that p and q are squarefree, n = p + q and p <= q.
  • A303223 (program): Sum of the perimeters of the family of rectangles with dimensions p and q such that |q - p| is prime, n = p + q and p < q.
  • A303224 (program): a(0)=0, a(1)=1; for n>1, a(n) = n*a(n-1) - 3*a(n-2).
  • A303226 (program): Number of minimal total dominating sets in the n-gear graph.
  • A303259 (program): Number of ordered rooted trees with n non-root nodes such that the maximal outdegree equals ceiling(n/2).
  • A303260 (program): Determinant of n X n matrix A[i,j] = (j - i - 1 mod n) + [i=j], i.e., the circulant having (n, 0, 1, …, n-2) as first row.
  • A303269 (program): Sum of squares of odd digits minus sum of squares of even digits of n.
  • A303272 (program): Multiples of 1852.
  • A303273 (program): Array T(n,k) = binomial(n, 2) + k*n + 1 read by antidiagonals.
  • A303276 (program): Decimal expansion of the value of 1 US gallon in liters.
  • A303277 (program): If n = Product (p_j^k_j) then a(n) = (Sum (k_j))^(Sum (p_j)).
  • A303278 (program): If n = Product_j p_j^k_j where the p_j are distinct primes then a(n) = (Product_j k_j)^(Product_j p_j).
  • A303279 (program): Expansion of (1/(1 - x)^2) * Sum_{p prime, k>=1} x^(p^k)/(1 - x^(p^k)).
  • A303281 (program): Expansion of (x/(1 - x)) * (d/dx) Sum_{p prime, k>=1} x^(p^k)/(1 - x^(p^k)).
  • A303295 (program): a(n) is the maximum water retention of a height-3 length-n number parallelogram with maximum water area.
  • A303296 (program): Digital roots of fourth powers A000583.
  • A303298 (program): Generalized 21-gonal (or icosihenagonal) numbers: m*(19*m - 17)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303299 (program): Generalized 22-gonal (or icosidigonal) numbers: m*(10*m - 9) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303302 (program): a(n) = 34*n^2.
  • A303303 (program): Generalized 23-gonal (or icositrigonal) numbers: m*(21*m - 19)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303304 (program): Generalized 25-gonal (or icosipentagonal) numbers: m*(23*m - 21)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303305 (program): Generalized 17-gonal (or heptadecagonal) numbers: m*(15*m - 13)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303306 (program): Expansion of Product_{n>=1} ((1 - (2*x)^n)/(1 + (2*x)^n))^(1/2).
  • A303307 (program): Expansion of Product_{n>=1} ((1 + (2*x)^n)/(1 - (2*x)^n))^(1/2).
  • A303331 (program): a(n) is the minimum size of a square integer grid allowing all triples of n points to form triangles of different areas.
  • A303336 (program): Number of rectangles with semiprime area and dimensions p,q where n = p+q and p <= q.
  • A303337 (program): Number of rectangles with semiprime area and dimensions (p) X (p+q) such that n = p+q, p < q.
  • A303342 (program): Expansion of Product_{k>=1} ((1 + (9*x)^k) / (1 - (9*x)^k))^(1/3).
  • A303361 (program): Expansion of Product_{n>=1} ((1 + (4*x)^n)/(1 - (4*x)^n))^(1/4).
  • A303365 (program): Number of integer partitions of the n-th squarefree number using squarefree numbers.
  • A303370 (program): Least integer k such that (k+1)^k >= n.
  • A303381 (program): Expansion of Product_{n>=1} ((1 + (8*x)^n)/(1 - (8*x)^n))^(1/8).
  • A303383 (program): Total volume of all cubes with side length q such that n = p + q and p <= q.
  • A303384 (program): Total area of all rectangles with dimensions s and t where s | t, n = s + t and s <= t.
  • A303385 (program): Total area of all rectangles with dimensions s and t such that s | t, n = s + t and s < t.
  • A303394 (program): Expansion of Product_{n>=1} ((1 - (4*x)^n)/(1 + (4*x)^n))^(1/4).
  • A303395 (program): Expansion of Product_{n>=1} ((1 - (8*x)^n)/(1 + (8*x)^n))^(1/8).
  • A303416 (program): Number of n X 3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
  • A303427 (program): Interleaved Lucas and Fibonacci numbers.
  • A303449 (program): Denominator of (2*n+1)/(2^(2*n+1)-1).
  • A303479 (program): Total volume of the family of rectangular prisms with dimensions p, q, and |q - p| where p divides q, n = p + q and p < q.
  • A303481 (program): Total volume of the family of rectangular prisms with dimensions p, q and p + q where p divides q, n = p + q and p < q.
  • A303486 (program): a(n) = n! * [x^n] 1/(1 - 3*x)^(n/3).
  • A303487 (program): a(n) = n! * [x^n] 1/(1 - 4*x)^(n/4).
  • A303488 (program): a(n) = n! * [x^n] 1/(1 - 5*x)^(n/5).
  • A303489 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals: A(n,k) = n! * [x^n] 1/(1 - k*x)^(n/k).
  • A303500 (program): The smallest positive even integer that can be written with n digits in base 3/2.
  • A303502 (program): Integers k such that the digits of k together with a single supplementary digit could be reordered to form a base-10 palindrome number.
  • A303505 (program): Number of odd chordless cycles in the n-triangular (Johnson) graph.
  • A303506 (program): G.f.: Sum_{n>=1} (-1)^(n-1) * x^(n^2)/(1 - x^n)^n.
  • A303534 (program): Amount by which n exceeds the largest binary palindrome less than or equal to n.
  • A303536 (program): Number of terms in greedy partition of n into binary palindromes.
  • A303537 (program): Expansion of ((1 + 4*x)/(1 - 4*x))^(1/4).
  • A303538 (program): Expansion of ((1 + 8*x)/(1 - 8*x))^(1/8).
  • A303554 (program): Union of the prime powers (p^k, p prime, k >= 0) and numbers that are the product of 2 or more distinct primes.
  • A303555 (program): Triangle read by rows: T(n,k) = 2^(n-k)*prime(k)#, 1 <= k <= n, where prime(k)# is the product of first k primes.
  • A303557 (program): a(0) = 1; a(n) = 2^(n-1)*prime(n)#, where prime(n)# is the product of first n primes.
  • A303565 (program): a(n) = [x^n] (Sum_{k=0..n} k!*x^k)/(Sum_{k=0..n} k!*(-x)^k).
  • A303566 (program): a(n) = [x^n] (Sum_{k=0..n} (k+1)!*x^k)/(Sum_{k=0..n} (k+1)!*(-x)^k).
  • A303577 (program): Break up the list of values of the divisor function d(k) into nondecreasing runs; sequence gives lengths of successive runs.
  • A303578 (program): List of starts of nondecreasing runs of values of d(n) (the divisor function A000005(n)).
  • A303581 (program): Add i (>= 0) to the i-th block of terms in the Thue-Morse sequence A010060.
  • A303586 (program): Number of partitions of n that contain no isolated singletons.
  • A303587 (program): Number of partitions of n that contain exactly one isolated singleton.
  • A303588 (program): Number of partitions of n that contain exactly two isolated singletons.
  • A303589 (program): Floor(n*alpha)-1, where alpha is the number with continued fraction expansion [1;1,2,3,4,5,…] (A247844).
  • A303590 (program): Floor(n*beta)-1, where 1/alpha+1/beta=1, alpha being the number with continued fraction expansion [1;1,2,3,4,5,…] (A247844).
  • A303602 (program): a(n) = Sum_{k = 0..n} k*binomial(2*n+1, k).
  • A303603 (program): a(n) is the maximum distance between primes in Goldbach partitions of 2n, or 2n if there are no Goldbach partitions of 2n.
  • A303609 (program): a(n) = 2*n^3 + 9*n^2 + 9*n.
  • A303611 (program): a(n) = (-1 - (-2)^(n-2)) mod 2^n.
  • A303617 (program): Decimal expansion of Sum_{k >= 0} 2^(2*k+1)/Product_{i = 0..k} (2*i+1).
  • A303631 (program): Number of nX3 0..1 arrays with every element unequal to 2 or 3 horizontally or vertically adjacent elements, with upper left element zero.
  • A303644 (program): a(n) is the number of lattice points in a Cartesian grid between a square of side length 2*n, centered at the origin, and its inscribed circle. The sides of the square are parallel to the coordinate axes.
  • A303647 (program): a(n) = ceiling(a(n-1)/(2^(1/3)-1)+1), a(1)=1.
  • A303649 (program): Number of involutions of [n] having exactly one peak.
  • A303658 (program): Decimal expansion of the alternating sum of the reciprocals of the triangular numbers.
  • A303663 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^prime(k))/(1 - x^k).
  • A303665 (program): Expansion of 1/((1 - x)*(1 - Sum_{k>=1} x^prime(k))).
  • A303666 (program): Expansion of 1/((1 - x)*(1 - Sum_{k>=0} x^(2^k))).
  • A303667 (program): Expansion of 2/((1 - x)*(3 - theta_3(x))), where theta_3() is the Jacobi theta function.
  • A303668 (program): Expansion of 1/((1 - x)*(2 - theta_2(sqrt(x))/(2*x^(1/8)))), where theta_2() is the Jacobi theta function.
  • A303677 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.
  • A303692 (program): a(n) = n^2*(2*n - 3 - (-1)^n)/4.
  • A303699 (program): Triangle read by rows in which row n gives coefficients of polynomial f_n(x) of degree less than n that satisfies Integral_{x=0..1} g(t - x) * f_n(x) dx = g(t) for any polynomial g(x) of degree less than n.
  • A303700 (program): Triangle read by rows in which row n gives coefficients of polynomial f_n(x)/(n+1) of degree less than n that satisfies Integral_{x=0..1} g(t - x) * f_n(x) dx = g(t) for any polynomial g(x) of degree less than n.
  • A303707 (program): Number of factorizations of n using elements of A007916 (numbers that are not perfect powers).
  • A303714 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1 or 5 king-move adjacent elements, with upper left element zero.
  • A303730 (program): Number of noncrossing path sets on n nodes with each path having at least two nodes.
  • A303735 (program): a(n) is the metric dimension of the n-dimensional hypercube.
  • A303739 (program): Numbers k such that 9*k^2 + 3*k + 1 (A082040) is prime.
  • A303740 (program): Primes of the form 9*k^2 + 3*k + 1 (A082040).
  • A303749 (program): First differences of A302774; Number of terms in A303762 that have prime(n) as their largest prime factor (A006530).
  • A303760 (program): Divisor-or-multiple permutation of squarefree numbers: a(0) = 1, and for n >= 1, a(n) is either the least divisor of a(n-1) not already present in the sequence, or (if all divisors already used), a(n-1) * {the least prime p such that p does not divide a(n-1) and p*a(n-1) is not already present}.
  • A303767 (program): May code of n: a(0) = 0, and for n > 0, if n = 2^k, a(n) = n + a(n-1), otherwise, when n = 2^k + r (with 0 < r < 2^k), then a(n) = 2^k + a(r-1); see comments for equivalent alternative descriptions.
  • A303768 (program): Inverse permutation to A303767.
  • A303781 (program): a(2) = 1; for n <> 2, a(n) = gcd(n, A000005(n)), where A000005(n) = number of divisors of n.
  • A303787 (program): a(n) = Sum_{i=0..m} d(i)*4^i, where Sum_{i=0..m} d(i)*5^i is the base-5 representation of n.
  • A303788 (program): a(n) = Sum_{i=0..m} d(i)*5^i, where Sum_{i=0..m} d(i)*6^i is the base-6 representation of n.
  • A303789 (program): a(n) = Sum_{i=0..m} d(i)*6^i, where Sum_{i=0..m} d(i)*7^i is the base-7 representation of n.
  • A303802 (program): Number of n X 2 0..1 arrays with every element unequal to 0, 1, 3 or 4 king-move adjacent elements, with upper left element zero.
  • A303812 (program): Generalized 28-gonal (or icosioctagonal) numbers: m*(13*m - 12) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303813 (program): Generalized 19-gonal (or enneadecagonal) numbers: m*(17*m - 15)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303814 (program): Generalized 24-gonal (or icositetragonal) numbers: m*(11*m - 10) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303815 (program): Generalized 29-gonal (or icosienneagonal) numbers: m*(27*m - 25)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303816 (program): Decimal expansion of 2700/17.
  • A303817 (program): Decimal expansion of 360/17.
  • A303834 (program): Number of total dominating sets in the n-gear graph.
  • A303846 (program): Total domination number of the n-halved cube graph.
  • A303872 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = -T(n-1,k) + 2 T(n-1,k-1) for k = 0,1,…,n; T(n,k)=0 for n or k < 0.
  • A303873 (program): Total area of the family of squares with side length n such that n = p + q, p divides q and p < q.
  • A303878 (program): Consider the representation of some integer (>1) as the sum of distinct unit fraction (<1). The sum of these denominators is least.
  • A303901 (program): Triangle read by rows of coefficients in expansion of (3-2x)^n, where n is a nonnegative integer.
  • A303902 (program): Expansion of (1 - x^2)*Product_{k>=2} (1 + x^k)^k.
  • A303904 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 + x^(k^3)).
  • A303906 (program): Expansion of Product_{k>=2} 1/(1 - x^(k*(k+1)/2)).
  • A303908 (program): Expansion of 1/(2 + x - theta_2(sqrt(x))/(2*x^(1/8))), where theta_2() is the Jacobi theta function.
  • A303909 (program): Expansion of 2*(1 - x)/(3 - theta_3(x)), where theta_3() is the Jacobi theta function.
  • A303915 (program): a(n) = lambda(n)*E(n), where lambda(n) = A008836(n) and E(n) = A005361(n).
  • A303916 (program): Constant term in the expansion of (Sum_{k=0..n} k*(x^k + x^(-k)))^3.
  • A303921 (program): Main diagonal of triangle A303920: a(n) = A303920(n,n) for n>=0.
  • A303941 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 3*T(n-1,k) - 2*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0. Triangle of coefficients of Fermat polynomials.
  • A303943 (program): Expansion of 1/(1 - x/(1 - 1^2*x/(1 - 2^2*x/(1 - 3^2*x/(1 - 4^2*x/(1 - …)))))), a continued fraction.
  • A303952 (program): a(n) is the number of monic polynomials P(z) of degree n over the complex numbers such that P(z) divides P(z^2).
  • A303963 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1, 3 or 5 king-move adjacent elements, with upper left element zero.
  • A303972 (program): Total volume of all cubes with side length n which can be split such that n = p + q, p divides q and p < q.
  • A303973 (program): Total volume of all rectangular prisms with dimensions (p,p,q) such that n = p + q, p divides q and p < q.
  • A303975 (program): Number of distinct prime factors in the product of prime indices of n.
  • A303977 (program): Number of inequivalent solutions to problem discussed in A286874.
  • A303986 (program): Triangle of derivatives of the Niven polynomials evaluated at 0.
  • A303987 (program): Triangle read by rows: T(n, k) = (binomial(n,k)*binomial(n+k,k))^2 = A063007(n, k)^2, for n >= 0, k = 0..n.
  • A303990 (program): Triangle, read by rows: n^k * k^n, for n >= 1 and k = 1..n.
  • A303991 (program): Row sums of triangle A303990.
  • A304001 (program): Number of permutations of [n] whose up-down signature has a nonnegative total sum.
  • A304004 (program): Number of n X 2 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.
  • A304011 (program): Number of same-sized pairs of subsets of set of n numbers that might have the same sum.
  • A304023 (program): a(n) is the smallest integer with n digits in base 3/2 expressed in base 3/2.
  • A304024 (program): a(n) is the largest integer with n digits in base 3/2.
  • A304025 (program): a(n) is the largest integer that can be written with n digits in base 3/2.
  • A304035 (program): a(n) is the number of lattice points inside a square bounded by the lines x=-n/sqrt(2), x=n/sqrt(2), y=-n/sqrt(2), y=n/sqrt(2).
  • A304037 (program): If n = Product (p_j^k_j) then a(n) = Sum (pi(p_j)^k_j), where pi() = A000720.
  • A304041 (program): Number of inequivalent solutions to problem in A054961.
  • A304066 (program): a(n) = Sum_{k=1..n} k*floor(n/prime(k)).
  • A304091 (program): a(n) is the number of the proper divisors of n that are Lucas numbers (A000032, with 2 included).
  • A304092 (program): Number of Lucas numbers (A000032: 2, 1, 3, 4, 7, 11, …) dividing n.
  • A304093 (program): a(n) is the number of the proper divisors of n that are Lucas numbers (A000204, with 2 excluded).
  • A304094 (program): Number of Lucas numbers (A000204: 1, 3, 4, 7, 11, … excluding 2) that divide n
  • A304095 (program): a(n) is the number of the proper divisors of n that are Lucas numbers larger than 3 (4, 7, 11, 18, …).
  • A304096 (program): Number of Lucas numbers larger than 3 (4, 7, 11, 18, …) that divide n.
  • A304100 (program): a(n) = A003602(A048679(n)).
  • A304126 (program): a(n) = (6*n)!*(4*n)!/((2*n)!*(3*n)!*(5*n)!).
  • A304128 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 3 or 6 king-move adjacent elements, with upper left element zero.
  • A304157 (program): a(n) is the first Zagreb index of the linear phenylene G[n], defined pictorially in the Darafsheh reference.
  • A304158 (program): a(n) is the second Zagreb index of the linear phenylene G[n], defined pictorially in the Darafsheh reference (Fig. 3).
  • A304159 (program): a(n) = 2*n^3 - 4*n^2 + 6*n - 2 (n>=1).
  • A304160 (program): a(n) = n^4 - 3*n^3 + 6*n^2 - 5*n + 2 (n >= 1).
  • A304161 (program): a(n) = 2*n^3 - 4*n^2 + 10*n - 2 (n>=1).
  • A304162 (program): a(n) = n^4 - 3*n^3 + 9*n^2 - 7*n + 5 (n>=1).
  • A304163 (program): a(n) = 9*n^2 - 3*n + 1 with n>0.
  • A304164 (program): a(n) = 27*n^2 - 21*n + 6 (n>=1).
  • A304165 (program): a(n) = 324*n^2 - 336*n + 102 (n >= 1).
  • A304166 (program): a(n) = 972*n^2 - 1224*n + 414 with n > 0.
  • A304167 (program): a(n) = 3^n - 2^(n-1) + 2 (n>=1).
  • A304168 (program): a(n) = 2*3^n - 2^(n-1) (n>=1).
  • A304169 (program): a(n) = 16*3^n + 2^(n+1) - 26 (n>=1).
  • A304170 (program): a(n) = 32*3^n + 18*2^n - 116 (n>=1).
  • A304171 (program): a(n) = 87*2^n - 38 (n>=0).
  • A304172 (program): a(n) = 99*2^n - 45 (n>=0).
  • A304180 (program): If n = Product (p_j^k_j) then a(n) = max{p_j}^max{k_j}.
  • A304182 (program): Number of primitive inequivalent mirror-symmetric sublattices of rectangular lattice of index n.
  • A304183 (program): Number of primitive inequivalent oblique sublattices of rectangular lattice of index n.
  • A304205 (program): Numbers k such that 24*k + 6 is congruent to 0 (mod 49).
  • A304207 (program): a(1)=17; for n>1, a(n) = (a(n-1)^2 - 1)/2 if n is even, a(n-1) + 1 if n is odd.
  • A304214 (program): Smallest k > 0 such that 2^(p-1) (mod p^2) < k*p for p = prime(n).
  • A304216 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 3 or 8 king-move adjacent elements, with upper left element zero.
  • A304225 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero.
  • A304236 (program): Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.
  • A304249 (program): Triangle T(n,k) = 3*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1 and T(n,k) = 0 for n < 0 or k < 0, read by rows.
  • A304251 (program): If n = Product (p_j^k_j) then a(n) = Sum (prime(p_j)^k_j).
  • A304252 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 6*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A304255 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 6*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A304265 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 5 or 8 king-move adjacent elements, with upper left element zero.
  • A304272 (program): The largest even integer that can be written with n digits in base 3/2.
  • A304273 (program): The concatenation of the first n terms is the smallest positive even number with n digits when written in base 3/2 (cf. A024629).
  • A304274 (program): The concatenation of the first n elements is the largest positive even number with n digits when written in base 3/2.
  • A304275 (program): Sum_{k=1..n} gcd(k,n) / cos(Pi*k/n)^2 for odd n.
  • A304293 (program): Number of points of a Koblitz curve E: y^2 + x*y = x^3 + a*x^2 + 1 over a field with 2^n elements.
  • A304326 (program): Number of ways to write n as a product of a number that is not a perfect power and a squarefree number.
  • A304327 (program): Number of ways to write n as a product of a perfect power and a squarefree number.
  • A304330 (program): T(n, k) = Sum_{j=0..k} (-1)^j*binomial(2*k, j)*(k - j)^(2*n), triangle read by rows, n >= 0 and 0 <= k <= n.
  • A304335 (program): Sum of digits of (2*n-1)!!.
  • A304337 (program): Lexicographically earliest fractal-like sequence such that the erasure of all pairs of contiguous terms of opposite parity leaves the sequence unchanged.
  • A304349 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1, 3, 4 or 5 king-move adjacent elements, with upper left element zero.
  • A304357 (program): Antidiagonal sums of the first quadrant of array A(k,m) = F_k(m), F_k(m) being the k-th Fibonacci polynomial evaluated at m.
  • A304364 (program): Numbers k such that A304362(k) = Sum_{d|k, d = 1 or not a perfect power} mu(k/d) = 0.
  • A304366 (program): Numbers n with additive persistence = 1.
  • A304367 (program): Numbers n with additive persistence = 2.
  • A304368 (program): Numbers n with additive persistence = 3.
  • A304370 (program): Number of function calls of the first kind required to compute ack(3,n), where ack denotes the Ackermann function.
  • A304371 (program): Number of function calls of the second kind required to compute ack(3,n), where ack denotes the Ackermann function.
  • A304373 (program): Numbers n with additive persistence = 4.
  • A304374 (program): a(n) = 9*n^2 + 21*n - 6 (n>=1).
  • A304375 (program): a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).
  • A304376 (program): a(n) = 60*2^n - 48 (n>=1).
  • A304377 (program): a(n) = 102*2^n - 96 (n>=1).
  • A304378 (program): a(n) = 4*(n - 1)*(16*n - 23) for n >= 1.
  • A304379 (program): a(n) = 256n^2 - 828n + 656 (n>=1).
  • A304380 (program): a(n) = 36*n^2 - 4*n (n>=1).
  • A304381 (program): a(n) = 54*n^2 - 26*n + 4 (n>=1).
  • A304383 (program): a(n) = 36*2^n - 5 (n>=1).
  • A304384 (program): a(n) = 168*2^n - 26 (n>=1).
  • A304385 (program): a(n) = 192*2^n - 31 (n>=1).
  • A304387 (program): a(n) = 27*2^n - 5.
  • A304388 (program): a(n) = 144*2^n - 20 (n>=1).
  • A304389 (program): a(n) = 126*2^n - 22 (n>=1).
  • A304404 (program): If n = Product (p_j^k_j) then a(n) = Product (n/p_j^k_j).
  • A304407 (program): If n = Product (p_j^k_j) then a(n) = Product ((p_j - 1)*k_j).
  • A304408 (program): If n = Product (p_j^k_j) then a(n) = Product ((p_j - 1)*(k_j + 1)).
  • A304409 (program): If n = Product (p_j^k_j) then a(n) = Product (p_j*(k_j + 1)).
  • A304411 (program): If n = Product (p_j^k_j) then a(n) = Product ((p_j + 1)*k_j).
  • A304412 (program): If n = Product (p_j^k_j) then a(n) = Product ((p_j + 1)*(k_j + 1)).
  • A304421 (program): Number of nX2 0..1 arrays with every element unequal to 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.
  • A304438 (program): Coefficient of s(y) in p(|y|), where s is Schur functions, p is power-sum symmetric functions, y is the integer partition with Heinz number n, and |y| = Sum y_i.
  • A304439 (program): Add to n the sum of its odd digits minus the sum of its even digits.
  • A304440 (program): Add to n the sum of its even digits minus the sum of its odd digits.
  • A304443 (program): Coefficient of x^n in Product_{k>=1} (1+x^k)^(2*n).
  • A304444 (program): Coefficient of x^n in Product_{k>=1} 1/(1-x^k)^(2*n).
  • A304445 (program): Coefficient of x^n in Product_{k>=1} (1+x^k)^(n^2).
  • A304446 (program): Coefficient of x^n in Product_{k>=1} 1/(1-x^k)^(n^2).
  • A304447 (program): Coefficient of x^n in Product_{k>=1} ((1+x^k)/(1-x^k))^(2*n).
  • A304448 (program): Coefficient of x^n in Product_{k>=1} ((1+x^k)/(1-x^k))^(n^2).
  • A304449 (program): Numbers that are either squarefree or a perfect power.
  • A304453 (program): An expanded binary notation for n: the normal binary expansion for n is expanded by mapping each 1 to 10 and retaining the existing 0’s.
  • A304455 (program): Number of steps in the reduction to a multiset of size 1 of the multiset of prime factors of n, obtained by repeatedly taking the multiset of multiplicities.
  • A304459 (program): Coefficient of x^n in Product_{k>=1} (1+x^k)^(n^3).
  • A304461 (program): Coefficient of x^n in Product_{k>=1} ((1+x^k)/(1-x^k))^(n^3).
  • A304480 (program): a(n) is the least m such that lambda(k) >= n for all k >= m where lambda is A002322, the Carmichael lambda function.
  • A304483 (program): a(n) = pi(n)*pi(2n), where pi is A000720: the prime counting function.
  • A304484 (program): a(n) = A033270(n)*A033270(2n), where A033270 counts the odd primes.
  • A304487 (program): a(n) = (3 + 2*n - 3*n^2 + 4*n^3 - 3*((-1 + n) mod 2))/6.
  • A304491 (program): Last or deepest exponent in the power-tower for n.
  • A304497 (program): Solution (a(n)) of the system of complementary equations defined in Comments.
  • A304498 (program): Solution (b(n)) of the system of complementary equations defined in Comments.
  • A304501 (program): Solution (b(n)) of the system of complementary equations defined in Comments.
  • A304503 (program): a(n) = 3*(n+1)*(9*n+4).
  • A304504 (program): a(n) = 3*(3*n+1)*(9*n+8)/2.
  • A304505 (program): a(n) = 4*(n+1)*(9*n+4).
  • A304506 (program): a(n) = 2*(3*n+1)*(9*n+8).
  • A304507 (program): a(n) = 5*(n+1)*(9*n+4).
  • A304508 (program): a(n) = 5*(3*n+1)*(9*n+8)/2 (n>=0).
  • A304509 (program): a(n) = 63*2^n - 39 (n>=1).
  • A304510 (program): a(n) = 69*2^n - 42 (n>=1).
  • A304511 (program): a(n) = 318*2^n - 186 (n>=1).
  • A304512 (program): a(n) = 366*2^n - 204 (n >= 1).
  • A304513 (program): a(n) = 57*2^(n-1) - 38 (n >= 1).
  • A304514 (program): a(n) = 33*2^n - 45 (n>=1).
  • A304515 (program): a(n) = 159*2^n - 222 (n>=1).
  • A304516 (program): a(n) = 192*2^n - 273 (n>=1).
  • A304517 (program): a(n) = 16*2^n - 11 (n>=1).
  • A304518 (program): a(n) = 68*2^n - 50 (n>=1).
  • A304519 (program): a(n) = 72*2^n -56 (n>=1).
  • A304569 (program): Triangle read by rows: T(n,k) = 1 if k | n^e with e >= 0, otherwise T(n,k) = 0 (1 <= k <= n).
  • A304573 (program): Number of non-perfect powers (A007916) less than n and relatively prime to n.
  • A304575 (program): a(n) = Sum_{d|n} #{k < d, k squarefree and relatively prime to d}.
  • A304577 (program): Period 21: repeat (0,0,0,0,1,1,1,1,1,0,1,0,1,0,0,1,1,0,0,0,1).
  • A304578 (program): a(n) = (n^2 + 1) * 5^n + (n^2 + 2) * 3^n.
  • A304579 (program): a(n) = (n^2 + 1)*(n^2 + 2).
  • A304583 (program): Period length 18: repeat 1,8,3,6,5,4,7,2,9,0,9,2,7,4,5,6,3,8.
  • A304584 (program): A linear mapping a(n) = x + d*n of pairs of nonnegative integers (x,d), where the pairs are enumerated by antidiagonals.
  • A304585 (program): A linear mapping a(n) = x + d*n of pairs of nonnegative integers (x,d), where the pairs are enumerated by meandering antidiagonals.
  • A304588 (program): Length of shortest prefix of the Thue-Morse word (A010060) such that some length-n block appears twice.
  • A304605 (program): a(n) = 48*2^n + 26 (n>=1).
  • A304606 (program): a(n) = 54*2^n + 28 (n >= 1).
  • A304607 (program): a(n) = 252*2^n + 140 (n>=1).
  • A304608 (program): a(n) = 288*2^n + 178 (n >= 1).
  • A304609 (program): a(n) = 114*n - 20.
  • A304610 (program): a(n) = 157*n - 40 (n>=1).
  • A304611 (program): a(n) = 155*n - 38.
  • A304612 (program): a(n) = 75*2^n - 38.
  • A304613 (program): a(n) = 87*2^n - 45.
  • A304614 (program): a(n) = 420*2^n - 222.
  • A304615 (program): a(n) = 507*2^n - 273.
  • A304616 (program): a(n) = 81*n^2 - 69*n + 24.
  • A304617 (program): a(n) = 324*n^2 - 564*n + 321 (n>=1).
  • A304618 (program): a(n) = 108*n^2 - 228*n + 114 (n>=2).
  • A304619 (program): a(n) = 324*n^2 - 804*n + 468 (n>=2).
  • A304620 (program): Expansion of (1/(1 - x)) * Sum_{k>=0} x^(2*k) / Product_{j=1..2*k} (1 - x^j).
  • A304625 (program): a(n) = [x^n] Product_{k>=1} ((1 - x^(n*k))/(1 - x^k))^n.
  • A304626 (program): a(n) = [x^n] Product_{k>=1} ((1 + x^k)/(1 + x^(n*k)))^n.
  • A304627 (program): a(n) = [x^n] Product_{k>=1} (1 + x^k)*(1 - x^(n*k))/((1 - x^k)*(1 + x^(n*k))).
  • A304630 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^(3*k))/(1 - x^k).
  • A304631 (program): Expansion of (1/(1 - x))*Product_{k>=1} (1 + x^(2*k-1)).
  • A304633 (program): Expansion of 2/((1 - x)*(3 + 2*x - theta_3(x))), where theta_3() is the Jacobi theta function.
  • A304634 (program): Numbers n with prime omicron 2, meaning A304465(n) = 2.
  • A304635 (program): Triangle T(n,j) read by rows: the number of j-faces in the hypersimplicial decomposition of the unit cube of n dimensions.
  • A304651 (program): Number of coprime pairs (x,y) with x^2 + y^2 <= n.
  • A304653 (program): a(n) = (-1)^Omega(n) if n is not a perfect power > 1, and 0 otherwise.
  • A304656 (program): Decimal expansion of Pi*sqrt(3).
  • A304659 (program): a(n) = n*(n + 1)*(16*n - 1)/6.
  • A304660 (program): A run-length describing inverse to A181819. The multiplicity of prime(k) in a(n) is the k-th smallest prime index of n, which is A112798(n,k).
  • A304685 (program): a(n) = A000699(n) (mod 3).
  • A304690 (program): Primes p > 5 such that no polygonal number P_s(k) (with s >= 3, k >= 5 ) is equal to p - 1.
  • A304710 (program): Number of partitions of 2n whose Ferrers-Young diagram cannot be tiled with dominoes.
  • A304723 (program): a(n) = 5^(n-1)*(3^n - 1)/2.
  • A304725 (program): a(n) = n^4 + 8*n^3 + 20*n^2 + 16*n + 2.
  • A304726 (program): a(n) = n^4 + 4*n^2 + 3.
  • A304727 (program): a(0) = 0, a(1) = 1, a(n) = n! * a(n-1) + a(n-2).
  • A304747 (program): May code shown in binary: a(n) = A007088(A303767(n)).
  • A304759 (program): Binary encoding of 1-digits in ternary representation of A048673(n).
  • A304809 (program): Solution (a(n)) of the complementary equation a(n) = b(2n) + b(4n) ; see Comments.
  • A304810 (program): Solution (b(n)) of the complementary equation a(n) = b(2n) + b(4n) ; see Comments.
  • A304817 (program): Number of divisors of n that are either 1 or not a perfect power.
  • A304819 (program): Dirichlet convolution of r with zeta, where r(n) = (-1)^Omega(n) if n is 1 or not a perfect power and r(n) = 0 otherwise.
  • A304824 (program): Convolution of central binomial coefficients and partition numbers.
  • A304825 (program): Sum of binomial(Y(2,p), 2) over the partitions p of n, where Y(2,p) is the number of part sizes with multiplicity 2 or greater in p.
  • A304826 (program): a(n) = 32*7^n/21 - 8/3, n>=1.
  • A304827 (program): a(n) = 52*7^n/21 - 16/3 (n>=1).
  • A304828 (program): a(n) = 344*7^n/21 - 128/3 (n>=1).
  • A304829 (program): a(n) = 4024*7^n/147 - 256/3 (n >= 2).
  • A304830 (program): a(n) = 102*2^n - 108 (n>=1).
  • A304831 (program): a(n) = 123*2^n - 135.
  • A304832 (program): a(n) = n^2 + 25*n - 34 (n >=2).
  • A304833 (program): a(n) = 3*n^2 + 38*n - 76 (n>=2).
  • A304834 (program): a(n) = 36*n^2 - 8*n - 2 (n >=1).
  • A304835 (program): a(n) = 108*n^2 - 104*n + 20 (n>=1).
  • A304836 (program): a(n) = 27*n^2 - 51*n + 24, n>=1.
  • A304837 (program): a(n) = 6*(n - 1)*(81*n - 104) for n >= 1.
  • A304838 (program): a(n) = 1944*n^2 - 5016*n + 3138 (n >= 1).
  • A304839 (program): a(n) = 61*n - 38 (n>=1).
  • A304840 (program): a(n) = 52*n - 2 (n>=1).
  • A304841 (program): a(n) = 67*n - 10 (n>=1).
  • A304866 (program): E.g.f. A(x) satisfies: Sum_{n>=0} (n*x - A(x))^n / n! = 1.
  • A304870 (program): L.g.f.: log(Product_{k>=1} (1 + x^k)^(k^k)) = Sum_{n>=1} a(n)*x^n/n.
  • A304887 (program): Number of non-isomorphic blobs of weight n.
  • A304902 (program): Let (P,<) be the strict partial order on the subsets of {1,2,…,n} ordered by their cardinality. Then a(n) is the number of paths of any length from {} to {1,2,…,n}.
  • A304906 (program): L.g.f.: log(Product_{k>=1} (1 + x^(k^3))) = Sum_{n>=1} a(n)*x^n/n.
  • A304907 (program): Expansion of x * (d/dx) 1/(1 - Sum_{k>=1} x^k/(1 + x^k)).
  • A304908 (program): Expansion of x * (d/dx) 1/(1 - Sum_{k>=0} x^(2^k)).
  • A304909 (program): Expansion of x * (d/dx) Product_{k>=0} 1/(1 - x^(2^k)).
  • A304915 (program): Expansion of ((1 + 16*x)/(1 - 16*x))^(1/16).
  • A304917 (program): a(n) = prime(n)^n - primorial(n - 1).
  • A304933 (program): a(0) = 0, a(1) = 1 and a(n) = 2*a(n-1)/(n-1) + 16*a(n-2) for n > 1.
  • A304934 (program): a(0) = 0, a(1) = 1 and a(n) = 2*a(n-1)/(n-1) + 64*a(n-2) for n > 1.
  • A304936 (program): a(n) = [x^n] 1/(1 - n*x/(1 - x - n*x/(1 - x - n*x/(1 - x - n*x/(1 - x - n*x/(1 - …)))))), a continued fraction.
  • A304939 (program): Number of labeled nonempty hypertrees (connected antichains with no cycles) spanning some subset of {1,…,n} without singleton edges.
  • A304940 (program): Expansion of ((1 + 4*x)/(1 - 4*x))^(1/2).
  • A304941 (program): Expansion of ((1 + 4*x)/(1 - 4*x))^(3/4).
  • A304944 (program): a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 16*a(n-2) for n > 1.
  • A304960 (program): Number of business cards required to build an origami level n Mosely snowflake sponge.
  • A304963 (program): Expansion of 1/(1 - Sum_{i>=1, j>=1, k>=1} x^(i*j*k)).
  • A304964 (program): Expansion of 1/(1 - Sum_{i>=1, j>=1, k>=1, l>=1} x^(i*j*k*l)).
  • A304968 (program): Number of labeled hypertrees spanning some subset of {1,…,n}, with singleton edges allowed.
  • A304973 (program): Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 3 colors (sets).
  • A304974 (program): Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 4 colors (sets).
  • A304979 (program): The nonzero terms of the cogrowth sequence of (Z/5Z)^*2 = <x|x^5=1> * <y|y^5=1> with respect to the generating set {(x,1), (1,y)}.
  • A304980 (program): a(n) = 4^n * (1 - 4^n) * Bernoulli(2*n) / (2*n) + EulerE(2*n).
  • A304990 (program): Squares of number of partitions into distinct parts.
  • A304991 (program): a(n) = A000041(n) * A000009(n).
  • A304993 (program): a(n) = n*(n + 1)*(7*n + 5)/6.
  • A304995 (program): Expansion of (1 + 6*x + 6*x^2 + 6*x^3 + x^4 + 6*x^5)/((1 - x)*(1 + x^4)).
  • A305004 (program): Number of labeled hypertrees (connected acyclic antichains) spanning some subset of {1,…,n} without singleton edges.
  • A305006 (program): Numerators of coefficients in expansion of Sum_{k>=1} x^k/(k*(1 + x^k)).
  • A305007 (program): Denominators of coefficients in expansion of Sum_{k>=1} x^k/(k*(1 + x^k)).
  • A305029 (program): Period 10 sequence [ 0, 2, 2, 2, 2, 0, -2, -2, -2, -2, …] except a(0) = 1.
  • A305031 (program): Expansion of ((1 + 2*x)/(1 - 2*x))^(3/2).
  • A305032 (program): a(0) = 0, a(1) = 1 and a(n) = 6*a(n-1)/(n-1) + 4*a(n-2) for n > 1.
  • A305035 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 6 or 7 king-move adjacent elements, with upper left element zero.
  • A305049 (program): Expansion of 1/(1 - Sum_{k>=1} tau_k(k)*x^k), where tau_k(k) = number of ordered k-factorizations of k (A163767).
  • A305051 (program): a(n) = n! * [x^n] exp(exp(x) - 1)/(1 - x)^n.
  • A305060 (program): a(n) = 18*2^n + 10.
  • A305061 (program): a(n) = 20*2^n + 14.
  • A305062 (program): a(n) = 96*2^n + 80.
  • A305063 (program): a(n) = 110*2^n + 118.
  • A305064 (program): a(n) = 42*2^n - 20.
  • A305065 (program): a(n) = 48*2^n - 24.
  • A305066 (program): a(n) = 234*2^n - 120.
  • A305067 (program): a(n) = 282*2^n - 150.
  • A305068 (program): a(n) = 54*n - 18 (n>=1).
  • A305069 (program): a(n) = 117*n - 72 (n>=1).
  • A305070 (program): a(n) = 378*n^2 - 54*n (n>=1).
  • A305071 (program): a(n) = 972*n^2 - 270*n (n>=1).
  • A305072 (program): a(n) = 144*n^2 - 24*n (n>=1).
  • A305073 (program): a(n) = 288*n^2 - 96*n (n>=1).
  • A305074 (program): a(n) = 20*n - 8 (n>=1).
  • A305075 (program): a(n) = 32*n - 24 (n>=1).
  • A305077 (program): Partial sums of absolute values of A076191.
  • A305078 (program): Heinz numbers of connected integer partitions.
  • A305098 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = -T(n-1,k) + 2 T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A305117 (program): a(n) = A304651(n)/4.
  • A305127 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^k)^(sigma(k)/k), where sigma(k) is the sum of the divisors of k.
  • A305133 (program): E.g.f.: (1-x) / (exp(-x) - x).
  • A305151 (program): a(n) = (2n+1) - A294673(n), the amount by which A294673 is less than the maximum possible for n.
  • A305152 (program): Expansion of Sum_{k>0} x^(k^2) / (1 + x^k).
  • A305153 (program): a(n) = 30*2^n + 12.
  • A305154 (program): a(n) = 36*2^n + 9.
  • A305155 (program): a(n) = 28*2^n - 15.
  • A305156 (program): a(n) = 136*2^n - 78 (n>=0).
  • A305157 (program): a(n) = 164*2^n - 99.
  • A305158 (program): a(n) = 21*2^n - 15.
  • A305159 (program): a(n) = 102*2^n - 78.
  • A305160 (program): a(n) = 123*2^n - 99.
  • A305163 (program): a(n) = 24*2^n - 18.
  • A305164 (program): a(n) = 28*2^n - 22.
  • A305165 (program): a(n) = 136*2^n - 112.
  • A305166 (program): a(n) = 164*2^n - 140.
  • A305168 (program): Number of non-isomorphic graphs on 4n vertices whose edges are the union of two n-edge matchings.
  • A305185 (program): a(n) minimizes the maximum norm of elements in a complete residue system of Eisenstein integers modulo n.
  • A305189 (program): a(n) = 1*2 + 3 + 4*5 + 6 + 7*8 + 9 + 10*11 + 12 + … + (up to n).
  • A305215 (program): a(n) is the number of numbers whose largest prime power factor equals A000961(n).
  • A305233 (program): Smallest k such that binomial(k, floor(k/2)) >= n.
  • A305237 (program): Numbers n such that n, n+1 and n+2 all have primitive roots.
  • A305258 (program): List of y-coordinates of a point moving in a smooth counterclockwise spiral rotated by Pi/4.
  • A305259 (program): x-coordinates of a point moving counterclockwise on concentric squares of grid points rotated by Pi/4 with side length m*sqrt(2), m=1,2,…, with jump to next square on the positive x-axis.
  • A305261 (program): a(n) = 120*2^n - 108.
  • A305262 (program): a(n) = 140*2^n - 127.
  • A305263 (program): a(n) = 680*2^n - 622.
  • A305264 (program): a(n) = 836*2^n - 771.
  • A305265 (program): a(n) = 12*2^n + 62.
  • A305266 (program): a(n) = 14*2^n + 73.
  • A305267 (program): a(n) = 68*2^n + 358.
  • A305268 (program): a(n) = 82*2^n + 440.
  • A305269 (program): a(n) = 120*2^n - 95.
  • A305270 (program): a(n) = 140*2^n - 112.
  • A305271 (program): a(n) = 680*2^n - 548.
  • A305272 (program): a(n) = 836*2^n - 676.
  • A305276 (program): Expansion of e.g.f. 1/(1 + LambertW(-x/(1 - x))).
  • A305290 (program): Numbers k such that 4*k + 1 is a perfect cube, sorted by absolute values.
  • A305291 (program): Numbers k such that 4*k + 3 is a perfect cube, sorted by absolute values.
  • A305292 (program): Numbers k such that k-1 is a square and k+1 is a triangular number.
  • A305295 (program): Binary encoding of 1-digits in ternary representation of A245612(n).
  • A305304 (program): Expansion of e.g.f. 1/(1 + LambertW(-x/(1 + x))).
  • A305306 (program): Expansion of e.g.f. 1/(1 + log(1 - x)/(1 - x)).
  • A305307 (program): Expansion of e.g.f. 1/(1 - log(1 + x)/(1 - x)).
  • A305315 (program): a(n) = sqrt(5*b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6*n+1), n >= 0.
  • A305316 (program): a(n) = sqrt(5*b(n)^2 - 4) with b(n) = Fibonacci(6*n+5) = A134497(n).
  • A305318 (program): Numbers k such that A071866(k)=3.
  • A305322 (program): Repdigit numbers that are divisible by 3.
  • A305326 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+2) = 1.
  • A305327 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+2) = 1.
  • A305328 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+2) = 1 (negated).
  • A305373 (program): a(n) = A003144(n) + A003145(n).
  • A305374 (program): First differences of A140101.
  • A305377 (program): Tribonacci representation of primes, written in base 10.
  • A305378 (program): Tribonacci representation of 2n+1, written in base 10.
  • A305379 (program): Tribonacci representation of primes, written in base 2.
  • A305385 (program): Indicator function of A140100.
  • A305386 (program): Indicator function of A140101.
  • A305387 (program): Indicator function of A140102.
  • A305388 (program): Indicator function of A140103.
  • A305390 (program): A ternary tribonacci sequence: define the morphism f: 1 -> 2, 2 -> 3, 3 -> 1,2,3; let S[k] be result of applying f k times to 1, for k =- 0,1,2,…; sequence gives limit S[3k+1] as k -> oo.
  • A305391 (program): A ternary tribonacci sequence: define the morphism f: 1 -> 2, 2 -> 3, 3 -> 1,2,3; let S[k] be result of applying f k times to 1, for k =- 0,1,2,…; sequence gives limit S[3k+2] as k -> oo.
  • A305392 (program): First differences of A140100.
  • A305393 (program): First differences of A140102.
  • A305394 (program): First differences of A140103.
  • A305395 (program): Records in A073053.
  • A305396 (program): Records in A171797.
  • A305397 (program): Largest diameter of a lattice polygon.
  • A305401 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Sum_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^(n-2*j).
  • A305404 (program): Expansion of Sum_{k>=0} (2*k - 1)!!*x^k/Product_{j=1..k} (1 - j*x).
  • A305412 (program): a(n) = F(n)*F(n+1) + F(n+2), where F = A000045 (Fibonacci numbers).
  • A305413 (program): a(n) = Fibonacci(11*n)/89.
  • A305426 (program): Number of proper divisors of n of the form 2^k - 1 for k >= 1.
  • A305435 (program): Number of proper divisors of n of the form 2^k + 1 for k >= 0.
  • A305436 (program): Number of divisors of n of the form 2^k + 1 for k >= 0.
  • A305444 (program): a(n) = Product_{p is odd and prime and divisor of n} (p - 2).
  • A305459 (program): a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) + a(n-2).
  • A305460 (program): a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) + 2*a(n-2).
  • A305461 (program): The number of one-digit numbers, k, in base n such that k^2 and k^3 end in the same digit.
  • A305465 (program): a(n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*n^(n-2*k).
  • A305466 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Sum_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^(n-2*j)*(-1)^j.
  • A305467 (program): a(n) = Sum_{k=0..floor(n/2)} ((n-k)!/k!)*binomial(n-k,k)*n^(n-2*k)*(-1)^k.
  • A305471 (program): a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) - a(n-2).
  • A305472 (program): a(0) = 1, a(1) = 3, a(n) = 3*n*a(n-1) - 2*a(n-2).
  • A305490 (program): Fixed point of the morphism 0->120, 1->110, 2->100.
  • A305491 (program): a(n) = numerator(r(n)) where r(n) = (((1/2)*(sqrt(3) + 1))^n - ((1/2)*(sqrt(3) - 1))^n * cos(Pi*n))/sqrt(3).
  • A305492 (program): a(n) = ((1 + y)^n - (1 - y)^n)/y with y = sqrt(8).
  • A305495 (program): Positions of 0 in the fixed point of the morphism 0->120, 1->110, 2->100 applied to 1 (as in A305490).
  • A305496 (program): Positions of 2 in the fixed point of the morphism 0->120, 1->110, 2->100 applied to 1 (as in A305490).
  • A305497 (program): The largest positive even integer that can be represented with n digits in base 3/2.
  • A305498 (program): The smallest positive even integer that can be represented with n digits in base 3/2.
  • A305499 (program): Square array A(n,k), n > 0 and k > 0, read by antidiagonals, with initial values A(1,k) = k and recurrence equations A(n+1,k) = A(n,k) for 0 < k <= n and A(n+1,k) = A(n,k) - A000035(n+k) for 0 < n < k.
  • A305503 (program): Largest cardinality of subsets A of {0,1,…,n-1} with |A + A| > |A - A|.
  • A305532 (program): Expansion of 1/(1 - x/(1 - 1*2*x/(1 - 2*3*x/(1 - 3*4*x/(1 - 4*5*x/(1 - …)))))), a continued fraction.
  • A305533 (program): Expansion of 1/(1 - x/(1 - 1*x/(1 - 3*x/(1 - 6*x/(1 - 10*x/(1 - … - (k*(k + 1)/2)*x/(1 - …))))))), a continued fraction.
  • A305535 (program): Expansion of 1/(1 - x/(1 - 2*x/(1 - 2*x/(1 - 4*x/(1 - 4*x/(1 - 6*x/(1 - 6*x/(1 - …)))))))), a continued fraction.
  • A305536 (program): Expansion of 1/(1 - x/(1 - x - 1*x/(1 - x - 2*x/(1 - x - 3*x/(1 - x - 4*x/(1 - …)))))), a continued fraction.
  • A305539 (program): a(n) is a generalized pentagonal number such that 2*a(n) is also a generalized pentagonal number.
  • A305548 (program): a(n) = 27*n.
  • A305549 (program): Crystal ball sequence for the lattice C_6.
  • A305559 (program): [0, -1, -1] together with A000290.
  • A305561 (program): Expansion of 2*x*(1 - 2*x)/(1 + 2*x - 8*x^2 - sqrt(1 - 4*x^2)).
  • A305573 (program): Number of (1,1) pairs occurring at depth 3n of the Fibonacci tree.
  • A305574 (program): Number of primitive (1,1) pairs in the Fibonacci tree at depth 3n.
  • A305581 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 7 or 8 king-move adjacent elements, with upper left element zero.
  • A305608 (program): Expansion of 1/2 * (((1 + 4*x)/(1 - 4*x))^(1/4) - 1).
  • A305609 (program): Expansion of 1/2 * (((1 + 8*x)/(1 - 8*x))^(1/8) - 1).
  • A305612 (program): Expansion of 1/2 * (((1 + 2*x)/(1 - 2*x))^(3/2) - 1).
  • A305615 (program): Next term is the largest earlier term that would not create a repetition of an earlier subsequence of length 2, if such a number exists; otherwise it is the smallest nonnegative number not yet in the sequence.
  • A305623 (program): Number of chiral pairs of rows of n colors with exactly 3 different colors.
  • A305624 (program): Number of chiral pairs of rows of n colors with exactly 4 different colors.
  • A305625 (program): Number of chiral pairs of rows of n colors with exactly 5 different colors.
  • A305626 (program): Number of chiral pairs of rows of n colors with exactly 6 different colors.
  • A305627 (program): a(n) = (2^n / n!) * (2^1 - 1) * (2^2 - 1) * … * (2^n - 1).
  • A305630 (program): Expansion of Product_{r = 1 or not a perfect power} 1/(1 - x^r).
  • A305634 (program): Even numbers that are not perfect powers.
  • A305635 (program): 1 and odd numbers that are not perfect powers.
  • A305650 (program): a(n) = -1/3 * (u^n-1)*(v^n-1) with u = 1+sqrt(3), v = 1-sqrt(3).
  • A305658 (program): Powers of 3 in base 3/2.
  • A305659 (program): Powers of 2 in base 3/2.
  • A305693 (program): a(n) = binomial(4*n, 2*n) - 4*n*binomial(2*n-2, n-1).
  • A305714 (program): Number of finite sequences of positive integers of length n that are polydivisible and strictly pandigital.
  • A305716 (program): Order of rowmotion on the divisor lattice for n.
  • A305721 (program): Crystal ball sequence for the lattice C_7.
  • A305722 (program): Crystal ball sequence for the lattice C_8.
  • A305723 (program): Crystal ball sequence for the lattice C_9.
  • A305724 (program): Crystal ball sequence for the lattice C_10.
  • A305728 (program): Numbers of the form 216*p^3, where p is a Pythagorean prime (A002144).
  • A305730 (program): a(n) is the total displacement of all letters in all permutations of n letters with no fixed points.
  • A305739 (program): a(n) = n!*T(n) - 1, where T(n) is the n-th triangular number.
  • A305747 (program): Let c be the n-th composite number; then a(n) is the smallest divisor of c such that a(n) >= sqrt(c).
  • A305748 (program): Distance of a prime number from the average of the next two consecutive prime numbers.
  • A305750 (program): Number of achiral color patterns (set partitions) in a row or cycle of length n with 4 or fewer colors (subsets).
  • A305753 (program): A base-3/2 sorted Fibonacci sequence that starts with a(0) = 0 and a(1) = 1. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the “digits” into increasing order, omitting all zeros.
  • A305762 (program): a(0) = 24, a(n) = 2^(max(0, min(3, p - 1))) * 3^(max(0, min(1, q - 1))) where n = 2^p * 3^q * 5^r * … .
  • A305800 (program): Filter sequence for a(prime) = constant sequences.
  • A305801 (program): Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is an odd prime, with f(n) = n for all other n.
  • A305818 (program): Number of proper divisors d of n such that 2d+1 is a prime.
  • A305833 (program): Triangle read by rows: T(0,0)=1; T(n,k) = 4*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A305834 (program): Triangle read by rows: T(0,0)= 1; T(n,k)= T(n-1,k) + 4*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A305837 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 5*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A305838 (program): Triangle read by rows: T(0,0)= 1; T(n,k)= T(n-1,k) + 5*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A305841 (program): Product_{n>=1} (1 + x^n)^a(n) = g.f. of A001970 (partitions of partitions).
  • A305847 (program): Solution a() of the complementary equation a(n) + b(n) = 5*n, where a(1) = 1. See Comments.
  • A305848 (program): Solution b() of the complementary equation a(n) + b(n) = 5n, where a(1) = 1. See Comments.
  • A305849 (program): Positions of 2 in the difference sequence of A305847.
  • A305859 (program): Numbers that are congruent to {1, 3, 11} mod 12.
  • A305861 (program): a(n) = 32*3^n - 2^(n+5) + 5.
  • A305862 (program): a(n) = 384*4^n - 576*3^n + 220*2^n - 14.
  • A305877 (program): Numbers in base 3 reversed.
  • A305878 (program): For any number n >= 0: apply the map 0 -> “0”, 1 -> “01”, 2 -> “011” to the ternary representation of n and interpret the result as a binary string.
  • A305880 (program): A base 3/2 reverse sorted Fibonacci sequence that starts with terms 2211 and 2211. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the digits into decreasing order, omitting all zeros.
  • A305889 (program): a(n) = 3*a(n-2) + a(n-4), a(0)=a(1)=0, a(2)=1, a(3)=2.
  • A305890 (program): Filter sequence for all such sequences b, for which b(A176997(k)) = constant for all k > 1, where A176997 is the union of odd primes and Fermat pseudoprimes.
  • A305897 (program): Lexicographically earliest infinite sequence such that a(i) = a(j) => A348717(i) = A348717(j), for all i, j >= 1.
  • A305900 (program): Filter sequence for a(primes > 3) = constant sequences.
  • A305930 (program): Number of digits ‘0’ in 3^n (in base 10).
  • A305931 (program): Powers of 3 having at least one digit ‘0’ in their decimal representation.
  • A305980 (program): Filter sequence for a(Squarefree numbers > 1) = constant sequences.
  • A305989 (program): Numbers in binary reversed.
  • A305990 (program): E.g.f.: (1+x) / (exp(-x) - x).
  • A305991 (program): Expansion of (1-27*x)^(1/9).
  • A305994 (program): a(n) = ((A000265(3*n + 1) + 1) mod 4)/2.
  • A306006 (program): Number of non-isomorphic intersecting set-systems of weight n.
  • A306007 (program): Number of non-isomorphic intersecting antichains of weight n.
  • A306008 (program): Number of non-isomorphic intersecting set-systems of weight n with no singletons.
  • A306020 (program): a(n) is the number of set-systems using nonempty subsets of {1,…,n} in which all sets have the same size.
  • A306021 (program): Number of set-systems spanning {1,…,n} in which all sets have the same size.
  • A306038 (program): Expansion of e.g.f. (1 + x)/(1 - log(1 + x)).
  • A306069 (program): Partial sums of A286324: Sum_{k=1..n} bd(k) where bd(k) is the number of bi-unitary divisors of k.
  • A306102 (program): Numbers that are the difference of two positive squares in at least two ways.
  • A306103 (program): Numbers that are the difference of two positive squares in at least three ways.
  • A306104 (program): Numbers that are the difference of two positive squares in at least four ways.
  • A306145 (program): Expansion of (1/(1 - x)) * Sum_{k>=0} x^(2*k+1) / Product_{j=1..2*k+1} (1 - x^j).
  • A306150 (program): Row sums of A306015.
  • A306156 (program): Inverse Weigh transform of 2^n.
  • A306157 (program): Inverse Weigh transform of 3^n.
  • A306158 (program): Inverse Weigh transform of 4^n.
  • A306159 (program): Inverse Weigh transform of 5^n.
  • A306174 (program): a(n) = (prime(n)^6 - 1)/504.
  • A306183 (program): The coefficients of x in the reduction of x^2 -> x + 1 for the polynomial p(n,x) = Product_{k=1..n} (x+k).
  • A306184 (program): a(n) = (2n+1)!! mod (2n)!! where k!! = A006882(k).
  • A306185 (program): a(n) = (2n+1)!! + (2n)!! where k!! = A006882(k).
  • A306190 (program): a(n) = p^2 - p - 1 where p = prime(n), the n-th prime.
  • A306192 (program): a(n) = (n - 1)*prime(n + 1).
  • A306193 (program): a(n) = Product_{k=0..n} (1 + n!/k!).
  • A306198 (program): Multiplicative with a(p^e) = p^(e-1)*(p^2 - p - 1).
  • A306199 (program): Numbers k having the property that tau(4*k) < tau(3*k) where tau = A000005.
  • A306210 (program): T(n,k) = binomial(n + k, n) - binomial(n + floor(k/2), n) + 1, square array read by descending antidiagonals (n >= 0, k >= 0).
  • A306237 (program): a(n) = primorial prime(n)#/prime(n - 1).
  • A306246 (program): a(1) = 1, a(2) = 2, and for any n > 2, a(n) = o(n-1) + o(n-2) where o(k) is the number of occurrences of a(k) among a(1), …, a(k).
  • A306251 (program): Ordinal transform of A306246.
  • A306258 (program): a(n) = floor(n^2/4)*n!.
  • A306262 (program): Difference between maximum and minimum sum of products of successive pairs in permutations of [n].
  • A306264 (program): a(n) = 1 + d*a(n/d); a(1)=0. If n has only one prime divisor, then d=n, otherwise d is the greatest proper unitary divisor of n.
  • A306266 (program): Number of reciprocally monophyletic coalescence sequences for 2n lineages, n each in 2 species.
  • A306276 (program): a(0) = a(1) = a(2) = a(3) = 1; thereafter a(n) = a(n-2) + a(n-3) + a(n-4).
  • A306277 (program): Numbers congruent to 1 or 8 mod 10.
  • A306278 (program): Numbers congruent to 2 or 11 mod 14.
  • A306279 (program): Numbers congruent to 3 or 18 mod 22.
  • A306280 (program): a(n) = Sum_{k=0..n} binomial(n,k)*binomial(n^2+k,k).
  • A306285 (program): Numbers congruent to 4 or 21 mod 26.
  • A306286 (program): a(n) is the product of the positions of the ones in the binary expansion of n (the most significant bit having position 1).
  • A306289 (program): The smallest prime factor of numbers greater than 1 and coprime to 6.
  • A306290 (program): a(n) = 1/(Integral_{x=0..1} (x^3 - x^4)^n dx).
  • A306292 (program): Number of asymmetric Dyck paths of semilength n.
  • A306295 (program): Maximal number of coalescent histories among non-matching pairs consisting of a caterpillar gene tree and a caterpillar species tree with n+2 leaves.
  • A306298 (program): Numbers k such that k^2-1 is divisible by exactly two distinct primes.
  • A306300 (program): Discriminant D of real quadratic number field Q(sqrt(D)) associated with fundamental discriminant d = A003658(n).
  • A306307 (program): Numbers that are divisible by the number of their nontrivial divisors.
  • A306312 (program): Number of terms of the set of divisors of n that are not the product of any other two distinct divisors.
  • A306323 (program): Break up the Kolakoski sequence A000002 into pieces by inserting a space between every pair of equal terms; sequence gives lengths of successive pieces.
  • A306326 (program): The q-analogs T(q; n,k) of the rascal-triangle, here q = 2.
  • A306329 (program): If n = Product (p_j^k_j) then a(n) = Product (p_j)^Sum (k_j).
  • A306331 (program): Numbers congruent to 6 or 31 mod 38.
  • A306344 (program): The q-analogs T(q; n,k) of the rascal-triangle, here q = 3.
  • A306354 (program): a(n) = gcd(n, A101337(n)).
  • A306357 (program): Number of nonempty subsets of {1, …, n} containing no three cyclically successive elements.
  • A306358 (program): Odd numbers which are the sum of two squares in two or more different ways.
  • A306362 (program): Prime numbers in A317298.
  • A306366 (program): For any sequence s of positive integers without infinitely many consecutive equal terms, let T(s) be the sequence obtained by replacing each run, say of k consecutive t’s, with a run of t consecutive k’s; this sequence corresponds to T(K) (where K denotes the Kolakoski sequence A000002).
  • A306367 (program): a(n) = numerator of (n^2 + 2)/(n + 2).
  • A306368 (program): a(n) = numerator of (n + 3)*(n + 4)/((n + 1)*(n + 2)).
  • A306369 (program): a(n) = A000010(n) + A069359(n).
  • A306376 (program): Sum of the 2 X 2 minors in the n X n Pascal matrix.
  • A306377 (program): a(n) = n^(n+1) - Sum_{k=1..n-1} k^(k+1).
  • A306379 (program): Dirichlet convolution of psi(n) with itself.
  • A306380 (program): Squares of the form 5*k^2 + 5.
  • A306388 (program): a(n) is a decimal number k having a length n binary expansion which encodes, from left to right at digit j, the coprimality (0) or non-coprimality (1) of j to n, for 1 < j <= n, except for the first digit, which is always 1.
  • A306389 (program): Partial sums of (k-th digit of decimal expansion of Pi multiplied by (-1)^k).
  • A306390 (program): Size of one subtree in the unlabeled binary rooted tree shape of size n whose leaf-labeled trees have the largest number of coalescence sequences.
  • A306392 (program): a(n) = 2^n with 1’s and 2’s swapped.
  • A306408 (program): a(n) = Sum_{d|n} (-1)^omega(n/d) * d.
  • A306409 (program): a(n) = -Sum_{0<=i<j<=n} (-1)^(i+j) * (i+j)!/(i!*j!).
  • A306411 (program): a(n) = phi(n^6) = n^5*phi(n).
  • A306412 (program): a(n) = phi(n^8) = n^7*phi(n).
  • A306419 (program): Number of set partitions of {1, …, n} whose blocks are all singletons and pairs, not including {1, n} or {i, i + 1} for any i.
  • A306423 (program): Number of coalescent histories for pseudocaterpillar gene trees G and caterpillar species trees S.
  • A306433 (program): Number of partitions of n into 2 distinct prime powers (not including 1).
  • A306436 (program): The nonnegative integers, the ten successive digits being swapped by pairs.
  • A306444 (program): A(n,k) = binomial((2*k+1)*n+2, k*n+1)/((2*k+1)*n+2), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.
  • A306447 (program): Number of (undirected) Hamiltonian cycles in the n-antiprism graph.
  • A306455 (program): Total number of covered falling diagonals in all n X n permutation matrices.
  • A306458 (program): a(n) = A001694(n)/A007947(A001694(n)), the powerful numbers divided by their squarefree kernel.
  • A306472 (program): a(n) = 37*27^n.
  • A306473 (program): a(n) is the maximum number of distinct palindromic not necessarily contiguous subwords over all binary words of length n.
  • A306476 (program): Numbers k, with sigma(k) >= 3k and sigma(k) divisible by 3, that are not in A204830.
  • A306480 (program): Numbers k such that A054404(k) is not floor(k/e - 1/(2*e) + 1/2).
  • A306486 (program): Number of squares in the interval [e^(n-1), e^n).
  • A306490 (program): Numbers k such that sigma(k) - k - 2 is prime.
  • A306495 (program): Expansion of e.g.f. (2-exp(-x))*exp(x)/(x-1)^2.
  • A306496 (program): Number of (undirected) Hamiltonian cycles in the n-crown graph.
  • A306504 (program): Expansion of 1/(x^6+2*x^5-x^4-4*x^3-x^2-2*x+1).
  • A306509 (program): a(n) is the number of divisors of the sum of digits of n.
  • A306511 (program): Number of permutations p of [n] having at least one index i with |p(i)-i| = 1.
  • A306519 (program): Expansion of 2/(1 + 2*x + sqrt(1 - 4*x*(1 + x))).
  • A306534 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals: A(n,k) = Sum_{j=0..n} floor(n/k^j).
  • A306535 (program): Number of permutations p of [2n] having no index i with |p(i)-i| = n.
  • A306545 (program): Number of permutations p of [2n+2] such that min_{j=1..2n+2} |p(j)-j| = n;
  • A306546 (program): Modified Collatz Map such that odd numbers are treated the same, but even numbers have all factors of 2 removed.
  • A306549 (program): a(n) is the product of the positions of the zeros in the binary expansion of n (the most significant bit having position 1).
  • A306556 (program): Integers that appear as (unreduced) numerators of segment endpoints when a ternary Cantor set is created.
  • A306561 (program): Square numbers that are also central polygonal numbers (i.e., square numbers found in the Lazy Caterer’s sequence).
  • A306562 (program): a(n) = 1 + 2 - 3 - 4 + 5 + 6 + 7 - 8 - 9 - 10 - 11 + 12 + 13 + 14 + 15 + … + (+-1)*n, where, after the 1st summand there is one plus, two minuses, three plusses, etc.
  • A306577 (program): Last odd number reached by n before 1 through Collatz iteration, where a(n) = 1 when no other odd number is reached, or -1 if 1 is never reached.
  • A306591 (program): a(n) is the denominator of 1/2 - 1/(prime(n)+1), where prime(n) is the n-th prime.
  • A306609 (program): a(n) = Sum_{k=0..n} k*binomial(4*n+2,2*k)
  • A306610 (program): a(n) = (2*cos(Pi/15))^(-n) + (2*cos(7*Pi/15))^(-n) + (2*cos(11*Pi/15))^(-n) + (2*cos(13*Pi/15))^(-n), for n >= 1.
  • A306623 (program): Expansion of e.g.f. exp(Sum_{k=1..8} x^k).
  • A306624 (program): Expansion of e.g.f. exp(Sum_{k=1..9} x^k).
  • A306628 (program): Expansion of e.g.f. log(Sum_{k>=0} (k*x)^k).
  • A306637 (program): a(n) = Fibonacci(n) * A128834(n).
  • A306642 (program): a(n) = Sum_{k=0..n} (3*n)!/(k! * (n-k)!)^3.
  • A306653 (program): a(n) = Sum_{m=1..n} Sum_{k=1..n} [k divides n]*[n/k divides m]*A008683(n/k)*n/k*[k divides m + 2^p]*A008683(k)*k, where p can be a positive integer: 1,2,3,4,5,…
  • A306656 (program): Number of ways to fill a 3D matrix with n distinct values.
  • A306671 (program): a(n) = gcd(tau(n), pod(n)) where tau(k) = the number of the divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).
  • A306672 (program): Partial sums of the even Lucas numbers (A014448).
  • A306674 (program): Number of distinct non-similar obtuse triangles with integer sides and length of largest side <= n.
  • A306675 (program): Number of permutations p of [2n] having at least one index i with |p(i)-i| = n.
  • A306680 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of g.f. ((1-x)^(k-1))/((1-x)^k-x^(k+1)).
  • A306682 (program): a(n) = gcd(sigma(n), pod(n)) where sigma(k) = the sum of the divisors of k (A000203) and pod(k) = the product of the divisors of k (A007955).
  • A306683 (program): Integers k for which the base-phi representation of k does not include 1 or phi.
  • A306684 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 2/(1 - x + sqrt(1 - 2*x + (1-4*k)*x^2)).
  • A306694 (program): a(n) is the denominator of log(A014963(n))/log(n) if n > 1 and a(1) = 1.
  • A306695 (program): a(n) = gcd(n, psi(n)).
  • A306696 (program): Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, if a(n) >= a(n+k), then a(n+2*k) <> a(n+k).
  • A306705 (program): a(n) = Product_{d|n} d*tau(d), where tau(k) = the number of the divisors of k (A000005).
  • A306712 (program): Decimal expansion of 3*sqrt(3)/Pi.
  • A306713 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. 1/(1-x^k-x^(k+1)).
  • A306721 (program): a(n) = Sum_{k=0..n} binomial(k, 7*(n-k)).
  • A306736 (program): Exponential infinitary highly composite numbers: where the number of exponential infinitary divisors (A307848) increases to record.
  • A306752 (program): a(n) = Sum_{k=0..n} binomial(k, 8*(n-k)).
  • A306753 (program): a(n) = Sum_{k=0..n} binomial(k, 9*(n-k)).
  • A306755 (program): a(n) = a(n-6) + a(n-7) with a(0)=7, a(1)=…=a(5)=0, a(6)=6.
  • A306756 (program): a(n) = a(n-7) + a(n-8) with a(0)=8, a(1)=…=a(6)=0, a(7)=7.
  • A306764 (program): a(n) is a sequence of period 12: repeat [1, 1, 6, 2, 1, 3, 2, 2, 3, 1, 2, 6].
  • A306770 (program): Decimal expansion of Sum_{k>=0} 1/(k! + (k+1)! + (k+2)!).
  • A306771 (program): Numbers m such that m = i + j = i * k and phi(m) = phi(i) + phi(j) = phi(i) * phi(k) for some i, j, k, where phi is the Euler totient function A000010.
  • A306775 (program): Partial sums of A060648: sum of the inverse Moebius transform of the Dedekind psi function from 1 to n.
  • A306780 (program): Decimal expansion of the constant S_1 - S_2 = Sum_{j>=1} (-1)^(j+1)*(prime(j)!/prime(j + 1)!).
  • A306789 (program): a(n) = Product_{k=0..n} binomial(n + k, n).
  • A306807 (program): An irregular fractal sequence: underline a(n) iff the absolute difference |a(n-1) - a(n)| is prime; all underlined terms rebuild the starting sequence.
  • A306809 (program): Binomial transform of the continued fraction expansion of e.
  • A306810 (program): Inverse binomial transform of the continued fraction expansion of e.
  • A306811 (program): Decimal expansion of Pi/(Pi - 1) = 1 + 1/Pi + 1/Pi^2 + … .
  • A306821 (program): Inverse binomial transform of the “original” Bernoulli numbers [A164555(n)/A027642(n)] with 1 and 1/2 swapped. Denominators.
  • A306825 (program): Primitive part of A001353(n).
  • A306829 (program): a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).
  • A306843 (program): a(n) = Sum_{d|n} binomial(n,d)^3.
  • A306846 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. ((1-x)^(k-1))/((1-x)^k-x^k).
  • A306847 (program): a(n) = Sum_{k=0..floor(n/6)} binomial(n,6*k).
  • A306848 (program): Product of first n odd nonprimes, a(n) = Product_{k=1..n) A071904(k).
  • A306852 (program): a(n) = Sum_{k=0..floor(n/7)} binomial(n,7*k).
  • A306858 (program): Decimal expansion of 1 - 1/(1*3) + 1/(1*3*5) - 1/(1*3*5*7) + …
  • A306859 (program): a(n) = Sum_{k=0..floor(n/8)} binomial(n,8*k).
  • A306860 (program): a(n) = Sum_{k=0..floor(n/9)} binomial(n,9*k).
  • A306863 (program): a(n) is the number of primes between the n-th and (n+1)-st odd composite numbers.
  • A306878 (program): Number of 0 < k < n such that n-k and n+k are both nonprimes.
  • A306890 (program): a(n) is the number of prime digits used in writing out all primes up to and including the n-th prime.
  • A306896 (program): a(n) = Sum_{d|n} (2^d + 2*(-1)^d)*phi(n/d).
  • A306897 (program): a(n) = A306896(n)/6.
  • A306898 (program): a(n) = Sum_{d|n} 2^d*phi(2*n/d).
  • A306905 (program): a(n) = A306898(n)/2.
  • A306915 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. 1/((1-x)^k-x^k).
  • A306921 (program): Number of ways of breaking the binary expansion of n into consecutive blocks with no leading zeros.
  • A306927 (program): a(n) = A001615(n) - n.
  • A306939 (program): Expansion of 1/((1 - x)^9 - x^9).
  • A306940 (program): Expansion of 1/((1 - x)^6 + x^6).
  • A306941 (program): Expansion of 1/((1 - x)^8 + x^8).
  • A306942 (program): Expansion of 1/((1 - x)^9 + x^9).
  • A306943 (program): Trajectory of 5 under repeated application of x -> A306938(x).
  • A306948 (program): Expansion of e.g.f. (1 + x)*log(1 + x)*exp(x).
  • A306957 (program): a(n) = n!*binomial(10,n).
  • A306958 (program): If the decimal expansion of n is d_1 … d_k, a(n) = Sum d_i!*binomial(10,d_i).
  • A306960 (program): Trajectory of 1 under repeated application of x -> A306958(x).
  • A306961 (program): Trajectory of 3 under repeated application of x -> A306958(x).
  • A306962 (program): Trajectory of 4 under repeated application of x -> A306958(x).
  • A306964 (program): Trajectory of 2 under repeated application of x -> A306958(x).
  • A306965 (program): If the decimal expansion of n is d_1 … d_k, a(n) = Sum binomial(10,d_i).
  • A306966 (program): Decimal expansion of t+t^2, where t is the tribonacci constant, the real root of x^3 - x^2 - x - 1.
  • A306967 (program): a(n) is the first Zagreb index of the Fibonacci cube Gamma(n).
  • A306988 (program): a(n) = Sum_{k=1..n} binomial(n,k)*phi(k), where phi is the Euler totient function.
  • A307000 (program): Number of unitary rings with additive group (Z/nZ)^2. Equivalently, number of unitary commutative rings with additive group (Z/nZ)^2.
  • A307001 (program): Odd numbers > 1 not of the form (3n*k - n - k + 1)/2 where n and k are odd numbers > 1.
  • A307005 (program): Expansion of e.g.f. (2*exp(x)-2*x-x^2)/(2-2*x-x^2).
  • A307006 (program): Expansion of e.g.f. (2*exp(x)-1-2*x-x^2)/(1-x-x^2).
  • A307011 (program): First coordinate in a redundant hexagonal coordinate system of the points of a counterclockwise spiral on an hexagonal grid. Second and third coordinates are given in A307012 and A345978.
  • A307012 (program): Second coordinate in a redundant hexagonal coordinate system of the points of a counterclockwise spiral on an hexagonal grid. First and third coordinates are given in A307011 and A345978.
  • A307013 (program): Third coordinate (asymmetric variant) in a redundant hexagonal coordinate system of the points of a counterclockwise spiral on an hexagonal grid. First and second coordinates are given in A307011 and A307012.
  • A307018 (program): Total number of parts of size 3 in the partitions of n into parts of size 2 and 3.
  • A307027 (program): Number of (undirected) paths in the complete bipartite graph K_{m,n} (triangle read by rows with m = 1..n and n = 1..).
  • A307035 (program): a(n) is the unique integer k such that A108951(k) = n!.
  • A307037 (program): The unitary analog of the alternating sum-of-divisors function (A206369).
  • A307040 (program): a(n) = Sum_{k=0..floor(n/6)} (-1)^k*binomial(n,6*k).
  • A307041 (program): a(n) = Sum_{k=0..floor(n/7)} (-1)^k*binomial(n,7*k).
  • A307044 (program): a(n) = Sum_{k=0..floor(n/8)} (-1)^k*binomial(n,8*k).
  • A307045 (program): a(n) = Sum_{k=0..floor(n/9)} (-1)^k*binomial(n,9*k).
  • A307047 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. 1/((1+x)^k-x^k).
  • A307055 (program): Even k such that psi(m) = k has no solution, where psi is the Dedekind psi function A001615.
  • A307059 (program): Expansion of 1/(2 - Product_{k>=1} (1 - x^k)).
  • A307062 (program): Expansion of 1/(2 - Product_{k>=1} (1 + x^k)^k).
  • A307063 (program): Expansion of 1/(2 - Product_{k>=1} (1 + k*x^k)).
  • A307064 (program): Expansion of 1 - 1/Sum_{k>=0} k!!*x^k.
  • A307066 (program): a(n) = exp(-1) * Sum_{k>=0} (n*k + 1)^n/k!.
  • A307073 (program): Expansion of 1/(1 - Sum_{k>=1} mu(k)^2*x^k/(1 - x^k)^2).
  • A307075 (program): Expansion of 1/(1 - Sum_{k>=1} mu(k)*x^k*(1 + x^k)/(1 - x^k)^3).
  • A307076 (program): Expansion of 1/(1 - Sum_{k>=1} lambda(k)*x^k), where lambda() is the Liouville function (A008836).
  • A307078 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. ((1-x)^(k-2))/((1-x)^k-x^k).
  • A307086 (program): Decimal expansion of 4*(5 - sqrt(5)*log(phi))/25, where phi is the golden ratio (A001622).
  • A307089 (program): Expansion of (1 - x)^4/((1 - x)^6 + x^6).
  • A307091 (program): a(n) = Sum_{k=0..floor(n/2)} (-1)^k * binomial(n,2*k)^2.
  • A307093 (program): a(n) = Sum_{k=0..n} (-1)^k * binomial(n,k^2).
  • A307094 (program): a(n) = Sum_{k=0..n} (-1)^k * binomial(n^2,k^2).
  • A307096 (program): Positive integers m such that for any positive integer k the last k bits of the binary expansion of m is not a multiple of 3.
  • A307100 (program): a(n) = Sum_{d|n} (tau(d)*pod(d)) where tau(k) = the number of divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).
  • A307101 (program): a(n) = Product_{d|n} (tau(d)*pod(d)) where tau(k) = the number of divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).
  • A307118 (program): a(1) = 0; for n>1, a(n) = dr(n-1) + dr(n) + dr(n+1), where dr(n) is the number of nontrivial divisors of n (A070824).
  • A307119 (program): a(1) = 1, for n>1, a(n) = dp(n-1) + dp(n) + dp(n+1), where dp(n) is the number of divisors of n less than n (A032741).
  • A307120 (program): a(1) = 3, for n>1, a(n) = A000005(n-1) + A000005(n) + A000005(n+1).
  • A307124 (program): a(n) is twice the square of the product of the first n primes each decreased by one.
  • A307135 (program): E.g.f. A(x) satisfies: d/dx A(x) = 1 + A(x*exp(-x)).
  • A307136 (program): a(n) = ceiling(2*sqrt(A000037(n))), n >= 1.
  • A307138 (program): State complexity profile of R-Lambda_24 version of Leech lattice.
  • A307152 (program): a(n) = floor((A002144(n)+19)/24).
  • A307158 (program): a(n) = Sum_{k=0..floor(n/3)} (-1)^k * binomial(n,3*k)^2.
  • A307163 (program): Minimum number of intercalates in a diagonal Latin square of order n.
  • A307168 (program): First class of all proper positive solutions x1(n) = a(n) of the Pell equation x^2 - 7*y^2 = 9.
  • A307169 (program): First class of all proper positive solutions y1(n) = a(n) of the Pell equation x^2 - 7*y^2 = 9.
  • A307172 (program): Second class of all proper positive solutions x2(n) of the Pell equation x^2 - 7*y^2 = 9.
  • A307173 (program): Second class of all proper positive solutions y2(n) = a(n) of the Pell equation x^2 - 7*y^2 = 9.
  • A307178 (program): Decimal expansion of coth(1/2).
  • A307182 (program): Crossing number of the n-crown graph (conjectured).
  • A307201 (program): Coordination sequence for trivalent node of type alpha in the first Moore pentagonal tiling.
  • A307202 (program): Coordination sequence for trivalent node of type alpha’ in the first Moore pentagonal tiling.
  • A307229 (program): Decimal expansion of (3*exp(1/2) - 1)/2.
  • A307233 (program): a(n) = Product_{k=1..n} (k^2 + k + 1) mod n.
  • A307240 (program): a(0) = 1; a(n) = Sum_{k=1..n} -lambda(k+1)*a(n-k), where lambda() is the Liouville function (A008836).
  • A307241 (program): a(0) = 1; a(n) = Sum_{k=1..n} (-1)^(k+1)*d(k+1)*a(n-k), where d() is the number of divisors (A000005).
  • A307242 (program): a(0) = 1; a(n) = Sum_{k=1..n} (-1)^(k+1)*sigma_2(k+1)*a(n-k), where sigma_2() is the sum of squares of divisors (A001157).
  • A307248 (program): a(n) is the number of n X n binary matrices (over the reals) with at least one row and column full of 1’s where the row index equals the column index.
  • A307253 (program): Number of triangles larger than size=1 in a matchstick-made hexagon with side length n.
  • A307258 (program): Expansion of (1/(1 + x)) * Product_{k>=1} 1/(1 - k*x^k/(1 + x)^k).
  • A307259 (program): Expansion of (1/(1 - x)) * Product_{k>=1} (1 + k*x^k/(1 - x)^k).
  • A307260 (program): Expansion of (1/(1 + x)) * Product_{k>=1} (1 + k*x^k/(1 + x)^k).
  • A307262 (program): Expansion of Product_{k>=1} (1 + k*x^k/(1 - x)^k).
  • A307264 (program): Expansion of (1/(1 - x)) * Product_{k>=1} 1/(1 + (-x)^k/(1 - x)^k).
  • A307265 (program): Expansion of Product_{k>=1} 1/(1 + (-x)^k/(1 - x)^k).
  • A307268 (program): Partial sums of the Lucas numbers of the form L(3n+2) (A163063).
  • A307271 (program): Partial sums of A307201.
  • A307272 (program): Partial sums of A307202.
  • A307294 (program): If n is even, a(n) = A000201(n/2+1), otherwise a(n) = A000201((n-1)/2+1) + 1.
  • A307295 (program): If n is even, a(n) = A001950(n/2+1), otherwise a(n) = A001950((n-1)/2+1) + 1.
  • A307304 (program): Number of inequivalent ways of placing 2 nonattacking rooks on n X n board up to rotations and reflections of the board.
  • A307310 (program): Expansion of Product_{k>=1} (1 - x^k/(1 - x)^k).
  • A307313 (program): a(n) is the denominator of n/2^(length of the binary representation of n).
  • A307314 (program): Number of divisors d of 2n such that adding d to 2n in binary requires no carries.
  • A307342 (program): Products of four primes, except fourth powers of primes.
  • A307346 (program): Number of uniquely sorted permutations of [2n+1] that avoid the patterns 231 and 4123.
  • A307349 (program): a(n) = Sum_{i=1..n} Sum_{j=1..n} (-1)^(i+j) * (i+j)!/(2!*i!*j!).
  • A307354 (program): a(n) = Sum_{0<=i<=j<=n} (-1)^(i+j) * (i+j)!/(i!*j!).
  • A307364 (program): Expansion of 1/(1 - Sum_{k>=1} prime(k)#*x^k), where prime(k)# is the product of first k primes (A002110).
  • A307368 (program): a(n) is the minimal positive integer such that 2*a(n)*prime(n)-1 equals another prime.
  • A307371 (program): Numbers k such that the digits of sqrt(k) begin with k.
  • A307373 (program): Heinz numbers of integer partitions with at least three parts, the third of which is 2.
  • A307374 (program): G.f. A(x) satisfies: A(x) = 1 + x - x^2*A(x)^2.
  • A307376 (program): a(n) = 1/n! * Sum_{k=0..n} (2*n+k)!/((n-k)!*k!*2^k).
  • A307386 (program): Heinz numbers of integer partitions with Durfee square of length 3.
  • A307389 (program): a(n) is the number of elements in the species of orbit polytopes in dimension n.
  • A307390 (program): Primes p such that 2*p-1 is not prime.
  • A307393 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of g.f. ((1-x)^(k-4))/((1-x)^k-x^k).
  • A307395 (program): Expansion of 1/((1 - x) * ((1 - x)^3 + x^3)).
  • A307408 (program): a(n) = (A001222(n) - 1)*A001221(n) + 2.
  • A307409 (program): a(n) = (A001222(n) - 1)*A001221(n).
  • A307413 (program): G.f. A(x) satisfies: A(x) = 1 + x*A(x)/(1 - x*A(x) - 2*x^2*A(x)^2).
  • A307420 (program): Dirichlet g.f.: zeta(2*s) * zeta(3*s) / zeta(s).
  • A307421 (program): Dirichlet g.f.: zeta(s) * zeta(3*s) / zeta(2*s).
  • A307423 (program): Dirichlet g.f.: zeta(2*s) / zeta(3*s).
  • A307424 (program): Dirichlet g.f.: zeta(3*s) / zeta(2*s).
  • A307425 (program): Dirichlet g.f.: zeta(s) / (zeta(2*s) * zeta(3*s)).
  • A307427 (program): Dirichlet g.f.: zeta(3*s) / (zeta(s) * zeta(2*s)).
  • A307428 (program): Dirichlet g.f.: zeta(2*s) / (zeta(s) * zeta(3*s)).
  • A307430 (program): Dirichlet g.f.: zeta(s) / zeta(4*s).
  • A307433 (program): A special version of Pascal’s triangle where only powers of 2 are permitted.
  • A307445 (program): Dirichlet g.f.: 1 / (zeta(s) * zeta(2*s)).
  • A307460 (program): Expansion of Product_{k>=1} (1-x^k)^((-1)^k*k^2).
  • A307462 (program): Expansion of Product_{k>=1} (1+x^k)^((-1)^k*k^2).
  • A307464 (program): Number of Catalan words of length n avoiding the pattern 000.
  • A307465 (program): Number of Catalan words of length n avoiding the pattern 110.
  • A307466 (program): Number of Catalan words of length n avoiding the pattern 210.
  • A307467 (program): The number of points, corresponding to the first n primes, and placed on the unit circle according to an algorithm using the data from A077218 (in the spirit of Ulam’s spiral, and described in the COMMENTS section below), which lie on the closed arc of the unit circle from 0 to 45 degrees.
  • A307469 (program): a(n) = 2*a(n-1) + 6*a(n-2) for n >= 2, a(0) = 1, a(1) = 5.
  • A307484 (program): Expansion of Product_{k>=1} 1/(1+x^k)^((-1)^k*k^2).
  • A307485 (program): A permutation of the nonnegative integers: one odd, two even, four odd, eight even, etc.; extended to nonnegative integer with a(0) = 0.
  • A307489 (program): G.f. A(x) satisfies: A(x) = 1/(1 - 2*x*A(x) - x*A(x)/(1 - x*A(x)/(1 - x*A(x)/(1 - …)))), a continued fraction.
  • A307490 (program): G.f. A(x) satisfies: A(x) = 1/(1 - x*A(x) - x^2*A(x)^2/(1 - x^2*A(x)^2/(1 - x^2*A(x)^2/(1 - …)))), a continued fraction.
  • A307495 (program): Expansion of Sum_{k>=0} k!*((1 - sqrt(1 - 4*x))/2)^k.
  • A307500 (program): Expansion of Product_{k>=1} 1/(1 - (x*(1 - x))^k).
  • A307508 (program): Primes p for which the continued fraction expansion of sqrt(p) does not have a 1 in the second position.
  • A307513 (program): Beatty sequence for 1/log(2).
  • A307515 (program): Heinz numbers of integer partitions with Durfee square of length > 2.
  • A307516 (program): Numbers whose maximum prime index and minimum prime index differ by more than 1.
  • A307517 (program): Numbers with at least two not necessarily distinct prime factors less than the largest prime factor.
  • A307520 (program): Expansion of Product_{k>=1} ((1 - x)^k - x^k)/((1 - x)^k + x^k).
  • A307521 (program): Expansion of Product_{k>=1} ((1 + x)^k + x^k)/((1 + x)^k - x^k).
  • A307522 (program): Expansion of Product_{k>=1} ((1 + x)^k - x^k)/((1 + x)^k + x^k).
  • A307533 (program): Primes p such that p+2 has exactly two distinct prime factors.
  • A307539 (program): Heinz numbers of square integer partitions, where the Heinz number of an integer partition (y_1,…,y_k) is prime(y_1)*…*prime(y_k).
  • A307548 (program): Expansion of Product_{k>=1} (1 - (x/(1+x))^k).
  • A307557 (program): Number of Motzkin meanders of length n with no level steps at odd level.
  • A307559 (program): a(n) = floor(n/3)*(n - floor(n/3))*(n - floor(n/3) - 1).
  • A307561 (program): Numbers k such that both 6*k - 1 and 6*k + 5 are prime.
  • A307562 (program): Numbers k such that both 6*k + 1 and 6*k + 7 are prime.
  • A307563 (program): Numbers k such that both 6k - 1 and 6k + 7 are prime.
  • A307574 (program): Expansion of Product_{k>=1} (1 - (x/(1-x))^k)^k.
  • A307593 (program): Expansion of e.g.f. (sec(x) + tan(x))*exp(x)/(1 - x).
  • A307594 (program): Expansion of e.g.f. (sec(x) + tan(x))*exp(-x)/(1 - x).
  • A307597 (program): Number of partitions of n into 2 distinct positive triangular numbers.
  • A307607 (program): a(n) = 1 + Sum_{d|n, d > 1} d^2*a(n/d).
  • A307612 (program): Partial sums of the permutation A307485: one odd, two even, four odd, eight even, etc.
  • A307613 (program): Inverse of the permutation A307485: one odd, two even, four odd, eight even, etc; extended with a(0) = 0.
  • A307614 (program): Number of partitions of the n-th triangular number into consecutive positive triangular numbers.
  • A307618 (program): A Calabi-Yau period integral: a(n) = C(4*n,2*n)*C(2*n,n)^3.
  • A307621 (program): Number of cycles in the n-dipyramidal graph.
  • A307627 (program): Primes p such that 2 is a primitive root modulo p while 8 is not.
  • A307628 (program): Primes p such that 2 is a primitive root modulo p while 32 is not.
  • A307641 (program): Triangle T(i,j=1..i) read by rows which contain the naturally ordered prime-or-one factorization of the row number i.
  • A307642 (program): a(n) = n!*Sum_{i=1..n} (Sum_{j=1..i} (i/j)).
  • A307645 (program): Numbers that are the sum of a positive triangular number and a positive cube.
  • A307646 (program): Numbers that are the sum of a prime number and a nonnegative cube.
  • A307647 (program): Numbers that are the sum of a prime number and a positive cube.
  • A307648 (program): G.f. A(x) satisfies: 1/(1 - x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* … *A(x^k)^k* …
  • A307654 (program): a(n) = Product_{p|n, p prime} (1 - p^p).
  • A307656 (program): G.f. A(x) satisfies: (1 - x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* … *A(x^k)^k* …
  • A307660 (program): E.g.f. A(x) satisfies: A(x) = exp(-x) * A(x^2)*A(x^3)*A(x^4)* … *A(x^k)* …
  • A307662 (program): Triangle T(i,j=1..i) read by rows which contain the naturally ordered divisors-or-ones of the row number i.
  • A307663 (program): a(n) = (n-1)!*(Sum_{i=1..n} Sum_{j=1..i} binomial(i,j)*i/j).
  • A307665 (program): A(n,k) = Sum_{j=0..floor(n/k)} binomial(2*n,k*j+n), square array A(n,k) read by antidiagonals, for n >= 0, k >= 1.
  • A307666 (program): Number of partitions of n into consecutive positive triangular numbers.
  • A307673 (program): Partial sums of A108754.
  • A307677 (program): a(0) = a(1) = a(2) = a(3) = 1; thereafter a(n) = a(n-1) + a(n-2) + a(n-4).
  • A307678 (program): G.f. A(x) satisfies: A(x) = 1 + x*A(x)^3/(1 - x).
  • A307679 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^k/(1 - x)^k)^(1/k).
  • A307681 (program): Difference between the number of diagonals and the number of sides for a convex n-gon.
  • A307682 (program): Products of four primes, two of which are distinct.
  • A307686 (program): Sum of the smallest side lengths of all integer-sided triangles with perimeter n.
  • A307688 (program): a(n) = 2*a(n-1)-2*a(n-2)+a(n-3)+2*a(n-4) with a(0)=a(1)=0, a(2)=2, a(3)=3.
  • A307692 (program): g values of Triphosian primes.
  • A307695 (program): Expansion of 1/(sqrt(1-4*x)*sqrt(1-16*x)).
  • A307702 (program): Clique covering number of the n-Sierpinski tetrahedron graph.
  • A307704 (program): Expansion of (1/(1 - x)) * Sum_{k>=1} (-x)^k/(1 - (-x)^k).
  • A307707 (program): Lexicographically earliest sequence starting with a(1) = 0 such that a(n) is the number of pairs of contiguous terms whose sum is a(n).
  • A307716 (program): Denominator of the barycenter of first n primes defined as a(n) = denominator(Sum_{i=1..n} (i*prime(i)) / Sum_{i=1..n} prime(i)).
  • A307726 (program): Number of partitions of n into 2 prime powers (not including 1).
  • A307742 (program): Quasi-logarithm A064097(n) of von Mangoldt’s exponential function A014963(n).
  • A307743 (program): a(n) = Sum_{k=1..n} A307742(k).
  • A307753 (program): Number of palindromic pentagonal numbers of length n whose index is also palindromic.
  • A307766 (program): Number of palindromic hexagonal numbers of length n whose index is also palindromic.
  • A307768 (program): Number of n-step random walks on a line starting from the origin and returning to it at least once.
  • A307778 (program): a(1) = 1; a(n+1) = Sum_{d|n} (-1)^(d+1)*a(d).
  • A307779 (program): a(1) = 1; a(n+1) = Sum_{d|n, n/d odd} a(d).
  • A307788 (program): Number of valid hook configurations of permutations of [n] that avoid the patterns 231 and 321.
  • A307789 (program): Number of valid hook configurations of permutations of [n] that avoid the patterns 231 and 1243.
  • A307791 (program): Number of palindromic heptagonal numbers of length n whose index is also palindromic.
  • A307800 (program): Binomial transform of least common multiple sequence (A003418), starting with a(1).
  • A307802 (program): Number of palindromic octagonal numbers of length n whose index is also palindromic.
  • A307803 (program): Inverse binomial transform of least common multiple sequence.
  • A307805 (program): a(n) = first position of prime(n) in A023503.
  • A307808 (program): Number of palindromic nonagonal numbers of length n whose index is also palindromic.
  • A307810 (program): Expansion of 1/AGM(1-64*x, sqrt((1-16*x)*(1-256*x))).
  • A307811 (program): Expansion of 1/AGM(1-45*x, sqrt((1-25*x)*(1-81*x))).
  • A307813 (program): a(n) = (5/32)*4^n - floor((n^2 + 1)/2)*2^(n - 2).
  • A307826 (program): The number of integers r such that all primes above a certain value have the form primorial(n)*q +- r.
  • A307832 (program): Number of palindromic decagonal (10-gonal) numbers of length n whose index is also palindromic.
  • A307844 (program): Constant term in the expansion of (n/x + 1 + n*x)^n.
  • A307845 (program): Exponential unitary highly composite numbers: where the number of exponential unitary divisors (A278908) increases to a record.
  • A307847 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*x + (1-4*k^2)*x^2).
  • A307848 (program): The number of exponential infinitary divisors of n.
  • A307849 (program): Number of ways to pay n dollars using Canadian coins, that is: nickels (5 cents), dimes (10 cents), quarters (25 cents), loonies (100 cents or $1 coins) and toonies ($2 coins).
  • A307855 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*x + (1-4*k)*x^2).
  • A307860 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*x + (1+4*k)*x^2).
  • A307862 (program): Coefficient of x^n in (1 + x - n*x^2)^n.
  • A307872 (program): Sum of the smallest parts in the partitions of n into 3 parts.
  • A307876 (program): a(n) is the smallest m such that there are prime(n) Pythagorean triangles with a leg (not hypotenuse) of length m, or -1 if no such m exists.
  • A307878 (program): Expansion of e.g.f. exp(3*x)*(sec(x) + tan(x)).
  • A307879 (program): Expansion of e.g.f. exp(4*x)*(sec(x) + tan(x)).
  • A307883 (program): Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*(k+1)*x + ((k-1)*x)^2).
  • A307884 (program): Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 + 2*(k-1)*x + ((k+1)*x)^2).
  • A307885 (program): Coefficient of x^n in (1 - (n-1)*x - n*x^2)^n.
  • A307889 (program): G.f. A(x) satisfies: A(x) = 1 + x*A(x^2)/(1 - x)^2.
  • A307892 (program): a(n) = lcm(tau(n), pod(n)) / n, where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955).
  • A307893 (program): a(n) = lcm(sigma(n), pod(n)) / n, where sigma (k) = the sum of divisors of k (A000203) and pod(n) = the product of divisors of k (A007955).
  • A307895 (program): Numbers whose prime exponents, starting from the largest prime factor through to the smallest, form an initial interval of positive integers.
  • A307897 (program): Dimensions of space of harmonic polynomials of each degree invariant under the icosahedral rotation group.
  • A307898 (program): Expansion of 1/(1 - x * Sum_{k>=1} prime(k)*x^k).
  • A307899 (program): Expansion of 1/(1 + x * Sum_{k>=1} prime(k)*x^k).
  • A307901 (program): Expansion of 1/(1 - x * theta_4(x)), where theta_4() is the Jacobi theta function.
  • A307904 (program): Coefficient of x^n in (1 + x + n*x^3)^n.
  • A307906 (program): Coefficient of x^n in 1/(n+1) * (1 + x + n*x^2)^(n+1).
  • A307907 (program): a(n) is the greatest k such that p^k <= n for any prime factor p of n.
  • A307908 (program): a(n) is the least k such that p^k >= n for any prime factor p of n.
  • A307911 (program): Coefficient of x^n in expansion of (1 - n*x - n*x^2)^n.
  • A307912 (program): a(n) = n - 1 - pi(2*n-1) + pi(n), where pi is the prime counting function.
  • A307913 (program): Numbers without the decimal digits 3, 6 and 9.
  • A307921 (program): Number of (undirected) paths in the n-book graph.
  • A307923 (program): Number of (undirected) Hamiltonian cycles in the n-cocktail party graph.
  • A307935 (program): Number of (undirected) Hamiltonian paths in the n-cocktail party graph.
  • A307939 (program): Number of (undirected) Hamiltonian paths in the n-dipyramidal graph.
  • A307946 (program): Coefficient of x^n in 1/(n+1) * (1 - n*x - n*x^2)^(n+1).
  • A307947 (program): Coefficient of x^n in 1/(n+1) * (1 + x - n*x^2)^(n+1).
  • A307966 (program): Sum of the largest side lengths of all integer-sided triangles with perimeter n.
  • A307969 (program): Coefficient of x^n in 1/(n+1) * (1 - 2*x - 2*x^2)^(n+1).
  • A307985 (program): Number of integer-sided triangles with perimeter n and sides a, b, and c such that a <= b <= c and b|n.
  • A307989 (program): a(n) = n - pi(2*n) + pi(n-1), where pi is the prime counting function.
  • A307993 (program): G.f. A(x) satisfies: A(x) = x + x^2 + x^3 * (1 + A(x) + A(x^2) + A(x^3) + …).
  • A307994 (program): G.f. A(x) satisfies: A(x) = x + x^2 + x^3 + x^4 * (1 + A(x) + A(x^2) + A(x^3) + …).
  • A307995 (program): G.f. A(x) satisfies: A(x) = x + x^2 + x^3 + x^4 + x^5 * (1 + A(x) + A(x^2) + A(x^3) + …).
  • A307996 (program): Expansion of e.g.f. exp(1 - exp(x)*(1 - 2*x)).
  • A307997 (program): a(n) is the sum of A023896(k) over the totatives of n.
  • A308003 (program): A modified Sisyphus function: a(n) = concatenation of (number of even digits in n) (number of digits in n) (number of odd digits in n).
  • A308005 (program): A modified Sisyphus function: a(n) = concatenation of (number of odd digits in n) (number of digits in n) (number of even digits in n).
  • A308025 (program): a(n) = n*(2*n - 3 - (-1)^n)*(5*n - 2 + (-1)^n)/16.
  • A308026 (program): a(n) = n*(2*n - 3 - (-1)^n)*(11*n + (-1)^n)/24.
  • A308034 (program): Number of partitions of n into 3 parts with at least 1 part that is a nondivisor of n.
  • A308035 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 2/(1 - x + sqrt(1 - 2*x + (1+4*k)*x^2)).
  • A308036 (program): Coefficient of x^n in 1/(n+1) * (1 + x - 3*x^2)^(n+1).
  • A308038 (program): a(n) = Sum_{i=1..floor((n-1)/2)} i * (n-i)^2.
  • A308044 (program): a(n) = 2*prevprime(2*n-1) - 2*n, where prevprime(n) is the largest prime < n.
  • A308046 (program): a(n) = 2*nextprime(n - 1) - 2*n, where nextprime(n) is the smallest prime > n.
  • A308047 (program): Sum of subgroup indices of dihedral group, Sum_{H <= D(n)} [D(n):H].
  • A308048 (program): a(n) = n - nextprime(ceiling(n/2) - 1), where nextprime(n) is the smallest prime > n.
  • A308050 (program): a(n) = n - prevprime(n - 1), where prevprime(n) is the largest prime < n.
  • A308052 (program): a(n) = nextprime(ceiling(n/2)-1), where nextprime(n) is the smallest prime > n.
  • A308066 (program): Number of triangles with perimeter n whose side lengths are even.
  • A308067 (program): Number of integer-sided triangles with perimeter n whose longest side length is odd.
  • A308068 (program): Number of integer-sided triangles with perimeter n whose longest side length is even.
  • A308077 (program): G.f. A(x) satisfies: A(x) = x - A(x^2) + A(x^3) - A(x^4) + A(x^5) - A(x^6) + …
  • A308084 (program): a(n) = n*(n-1)*d(n)/4, where d(n)=A000005(n) is the number of divisors of n.
  • A308089 (program): Sum of the perimeters of all integer-sided triangles with perimeter n.
  • A308090 (program): a(n) = gcd(2^n + n!, 3^n + n!, n+1).
  • A308095 (program): a(n) is the sum of sigma (i.e., A000203) over the totatives of n.
  • A308096 (program): Take all the integer-sided triangles with perimeter n and sides a, b, and c such that a <= b <= c. a(n) is the sum of all the b’s.
  • A308102 (program): Sum of the perimeters of all integer-sided scalene triangles with perimeter n.
  • A308107 (program): Sum of the smallest side lengths of all integer-sided scalene triangles with perimeter n.
  • A308108 (program): Sum of the largest side lengths of all integer-sided scalene triangles with perimeter n.
  • A308109 (program): Take all the integer-sided triangles with perimeter n and sides a, b, and c such that a < b < c. a(n) is the sum of all the b’s.
  • A308123 (program): Sum of the perimeters of all integer-sided isosceles triangles with perimeter n.
  • A308124 (program): a(n) = (2 + 7*4^n)/3.
  • A308135 (program): Sum of non-coreful divisors of n.
  • A308136 (program): Number of (undirected) Hamiltonian paths in the 2n-crossed prism graph.
  • A308137 (program): Number of (undirected) Hamiltonian paths on the n-prism graph.
  • A308149 (program): Positive integers with Collatz trajectories that do not include the number 5.
  • A308150 (program): Numbers k such that sigma(k) mod k is prime, where sigma = A000203.
  • A308158 (program): Sum of the smallest side lengths of all integer-sided isosceles triangles with perimeter n.
  • A308159 (program): Sum of the largest sides of all integer-sided isosceles triangles with perimeter n.
  • A308160 (program): Take all the integer-sided isosceles triangles with perimeter n and sides a, b, and c such that a <= b <= c. a(n) is the sum of all the b’s.
  • A308166 (program): Number of integer-sided triangles with perimeter n such that the smallest side divides the largest.
  • A308167 (program): Number of integer-sided triangles with perimeter n and sides a, b, and c such that a <= b <= c and a|b.
  • A308169 (program): Numbers k such that A023896(k) mod A000203(k) is prime.
  • A308183 (program): S_oo, where S_1 = bc, S_n = S_{n-1} a^n S_{n-1} for n > 1, over the alphabet {a,b,c} = {0,1,2}.
  • A308184 (program): S_oo, where S_1 = bc, S_n = S_{n-1} a^n S_{n-1} for n > 1, over the alphabet {a,b,c} = {1,2,3}.
  • A308185 (program): Fixed point (beginning with a) of the morphism a -> abab, b -> b, over the alphabet {a,b} = {0,1}.
  • A308186 (program): Fixed point (beginning with a) of the morphism a -> abab, b -> b, over the alphabet {a,b} = {1,2}.
  • A308187 (program): Fixed point (beginning with a) of the morphism a -> aab, b -> b, over the alphabet {a,b} = {0,1}.
  • A308188 (program): Fixed point (beginning with a) of the morphism a -> aab, b -> b, over the alphabet {a,b} = {1,2}.
  • A308189 (program): Numbers of the form t_n or t_n + t_{n+1} where {t_n} are the tribonacci numbers A000073.
  • A308196 (program): Partial sums of A063808.
  • A308197 (program): Numbers m such that the tribonacci representation of m (A278038) ends in an even number of 0’s.
  • A308198 (program): Numbers m such that the tribonacci representation of m (A278038) ends in an odd number of 0’s.
  • A308199 (program): The tribonacci representation of a(n) is obtained by appending 0,0 to the tribonacci representation of n (cf. A278038).
  • A308200 (program): The tribonacci representation of a(n) is obtained by appending 0,0,0 to the tribonacci representation of n (cf. A278038).
  • A308215 (program): a(n) is the multiplicative inverse of A001844(n+1) modulo A001844(n); where A001844 is the sequence of centered square numbers.
  • A308217 (program): a(n) is the multiplicative inverse of A001844(n) modulo A001844(n+1); where A001844 is the sequence of centered square numbers.
  • A308222 (program): Numbers that are the perimeter of a primitive Heronian isosceles triangle.
  • A308230 (program): Irregular triangle: row n shows the alternating sums of partitions of n when the parts are arranged in nonincreasing order and the partitions are arranged lexicographically from [n] to [1,1,1,…,1].
  • A308259 (program): a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.
  • A308265 (program): Sum of the largest parts in the partitions of n into 3 parts.
  • A308266 (program): Sum of the middle parts in the partitions of n into 3 parts.
  • A308281 (program): The third power of the unsigned Lah triangular matrix A105278.
  • A308282 (program): The fifth power of the unsigned Lah triangular matrix A105278.
  • A308287 (program): Length 20 arithmetic progression of primes (PAP-20).
  • A308303 (program): Number of integer-sided triangles with perimeter n and at least one even side length.
  • A308305 (program): a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393).
  • A308313 (program): a(n) = Sum_{k=1..n} (-1)^(n-k) * k^n * floor(n/k).
  • A308320 (program): Decimal expansion of 2^(-7/4); exact length of the A4 paper size measured in meters according to the ISO 216 standard.
  • A308321 (program): Decimal expansion of 2^(-9/4); exact width of the A4 paper size measured in meters according to the ISO 216 standard.
  • A308329 (program): Even moments of the trace of elements of the binary icosahedral group.
  • A308341 (program): Hypotenuses of primitive Pythagorean triangles two sides of which are Pythagorean primes.
  • A308344 (program): a(n) = (A001359(n+1)^2 - 1)/24, where A001359 = lesser of twin primes; or: pentagonal numbers (A000326) whose indices are twin ranks (A002822).
  • A308346 (program): Expansion of e.g.f. 1/(1 - x)^log(1 - x).
  • A308347 (program): n-th digit in the base-6 expansion of 1/n.
  • A308351 (program): For n >= 2, a(n) = n*u(n-1) + n*(n-1)*u(n-2), where u = A292932; a(1)=1.
  • A308352 (program): Number of k-ary quasitrivial semigroups that have no neutral element on an n-element set.
  • A308354 (program): Number of (2k+1)-ary quasitrivial semigroups that have two neutral elements on an n-element set.
  • A308355 (program): Limiting row sequence of the array A128628.
  • A308357 (program): Smallest k such that k! can be represented as the sum of the n-th powers of two or more distinct primes; or -1 if no such k exists.
  • A308358 (program): Beatty sequence for sqrt(3)/4.
  • A308361 (program): The largest codimension of a cyclically covering subspace in GF(2)^n.
  • A308364 (program): a(0) = 0, a(3n) = a(n), a(3n+1) = a(n)*3 + 1, a(3n-1) = a(n)*3 - 1.
  • A308366 (program): Expansion of Sum_{k>=1} (-1)^(k+1)*k*x^k/(1 - k*x^k).
  • A308367 (program): Expansion of Sum_{k>=1} x^k/(1 + k*x^k).
  • A308375 (program): Digital sum of composite numbers.
  • A308381 (program): Expansion of e.g.f. exp(Sum_{k>=1} x^(k^2)*(2 + x^(k^2))/(2*k^2)).
  • A308385 (program): a(n) is the last square visited by fers moves on a spirally numbered (2n-1) X (2n-1) board, moving to the lowest available unvisited square at each step.
  • A308392 (program): Expansion of e.g.f. exp(x + 2 * Sum_{k>=1} x^(2^k)/2^k).
  • A308396 (program): Expansion of e.g.f. exp(-Sum_{k>=1} x^(k^2)/k^2).
  • A308399 (program): Expansion of 1 / Sum_{k=-oo..oo} (-x)^(k*(4*k + 1)).
  • A308401 (program): Number of bracelets (turnover necklaces) of length n that have no reflection symmetry and consist of 6 white beads and n-6 black beads.
  • A308416 (program): Values of m for which 2*p + m cannot be a square when p is a prime.
  • A308417 (program): Expansion of e.g.f. exp(x*(1 + x + x^2)/(1 - x^2)^2).
  • A308418 (program): Expansion of e.g.f. exp(x*(1 + 3*x + 6*x^2 + 3*x^3 + x^4)/(1 - x^2)^3).
  • A308422 (program): a(n) = n^2 if n odd, 3*n^2/4 if n even.
  • A308432 (program): Given n cards in a stack numbered from 1 to n with 1 at the top, repeat the following process: first remove the card that is in the middle (at position (size of the stack)/2, rounding up), then move the card that is at the bottom of the stack to the top. This process is repeated until there is only one card left. a(n) is the number of the last remaining card.
  • A308434 (program): n! + n!!.
  • A308435 (program): Peak- and valleyless Motzkin meanders.
  • A308436 (program): Expansion of 1/((1-2*x)*(1-4*x)*(1-8*x)*(1-16*x)*(1-32*x)).
  • A308439 (program): a(n) is the smallest prime factor of 1 + the product of primes indexed by the binary digits of n.
  • A308443 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^k)^(psi(k)/k), where psi() is the Dedekind psi function (A001615).
  • A308445 (program): a(0) = 1; a(n) = Sum_{k=1..n} gcd(n,k)*a(n-k).
  • A308457 (program): Expansion of e.g.f. (1/(1 - x)) * Product_{k>=2} 1/(1 - x^k)^(phi(k)/2), where phi() is the Euler totient function (A000010).
  • A308462 (program): Expansion of e.g.f. exp(Sum_{k>=1} psi(k)*x^k/k), where psi() is the Dedekind psi function (A001615).
  • A308464 (program): Squarefree numbers of the form m^2 + 4.
  • A308467 (program): The smallest positive n-digit 4th power.
  • A308469 (program): a(1) = 1, a(2)=2, a(n) = a(n-1) + gcd(a(n-2), n-2).
  • A308470 (program): a(n) = (gcd(phi(n), 4*n^2 - 1) - 1)/2, where phi is A000010, Euler’s totient function.
  • A308472 (program): Numbers that are divisible by the sum of the digits of the product of their digits.
  • A308473 (program): Sum of numbers < n which have common prime factors with n.
  • A308474 (program): a(n) = Sum_{k=1..n^2, gcd(n,k) = 1} k.
  • A308480 (program): a(n) = A000225(n) if n is prime, a(n) = A020639(n) otherwise.
  • A308481 (program): a(n) = Sum_{k=1..n, gcd(n,k) = 1} k^n.
  • A308485 (program): a(n) is the sum of the integer logs of all integers strictly between prime(n) and prime(n+1).
  • A308495 (program): a(n) is the position of the first occurrence of prime(n) in A027748.
  • A308498 (program): Triangle read by rows where T(n,k), n>=1, 1<=k<=n is the number of (0,1)-matrices of size n with the first row and column sum = k and remaining sums = 1.
  • A308501 (program): Partial products of odious numbers.
  • A308506 (program): Expansion of e.g.f.: -1/(1-LambertW(-2*x)).
  • A308520 (program): Expansion of e.g.f. exp(x)*(1 + x + x^2/2)*(sec(x) + tan(x)).
  • A308521 (program): Expansion of e.g.f. (sec(x) + tan(x))/(1 - 2*x).
  • A308523 (program): Number of essentially simple rooted toroidal triangulations with n vertices.
  • A308524 (program): Number of essentially 3-connected rooted toroidal maps with n edges.
  • A308528 (program): Number of length-n binary words having no nontrivial prefix that is a palindrome of odd length.
  • A308536 (program): Expansion of e.g.f. exp(1 - exp(2*x)).
  • A308538 (program): a(n) = exp(1) * Sum_{k>=0} (-1)^k*(k*(k + 1))^n/k!.
  • A308543 (program): Expansion of e.g.f. exp(2*(exp(2*x) - 1)).
  • A308546 (program): Number of double-closed subsets of {1..n}.
  • A308567 (program): Consider the second least-significant bits of the first n prime numbers: a(n) equals the number of zeros minus the number of ones.
  • A308570 (program): a(n) = sigma_{2*n}(n).
  • A308572 (program): a(n) = Fibonacci(2*prime(n)).
  • A308578 (program): Maximum number of non-overlapping circles of radius 1/n that can be placed inside a unit square.
  • A308579 (program): a(n) = (9*2^n - 6*n - 10)/2.
  • A308580 (program): a(n) = 3*2^n + n^2 - n.
  • A308585 (program): a(n) = 2^(n + 3) - 10*n - 6.
  • A308589 (program): Number of minimal edge covers in the (2n-1)-triangular snake graph.
  • A308592 (program): Number of total dominating sets in the (2n-1)-triangular snake (for n > 1).
  • A308593 (program): a(n) = Sum_{d|n} d^(n^2/d).
  • A308594 (program): a(n) = Sum_{d|n} d^(d+n).
  • A308596 (program): a(n) is the product of the prime(n) smallest primes other than prime(n).
  • A308598 (program): The smaller term of the pair (a(n), a(n+1)) is always prime and in each pair there is a composite number; a(1) = 2 and the sequence is always extended with the smallest integer not yet present and not leading to a contradiction.
  • A308599 (program): Number of (not necessarily maximum) cliques in the n-alternating group graph.
  • A308600 (program): Number of (not necessarily maximum) cliques in the n X n antelope graph.
  • A308602 (program): Number of (not necessarily maximum) cliques in the n-cycle graph.
  • A308603 (program): Number of (not necessarily maximal) cliques in the n-dipyramidal graph.
  • A308604 (program): Number of (not necessarily maximal) cliques in the n X n fiveleaper graph.
  • A308606 (program): Number of (not necessarily maximum) cliques in the n-transposition graph.
  • A308607 (program): Number of (not necessarily maximum) cliques in the wheel graph on n vertices.
  • A308616 (program): Number of well-formed formulas of length n in a formal propositional language with one unitary operator, one binary operator, and one propositional variable.
  • A308632 (program): Largest aggressor for the maximum number of peaceable coexisting queens as given in A250000.
  • A308645 (program): Expansion of e.g.f. exp(1 + x - exp(2*x)).
  • A308646 (program): a(n) = exp(1) * Sum_{k>=0} (-1)^k*k^(2*n)/k!.
  • A308647 (program): a(n) = exp(1) * Sum_{k>=0} (-1)^k*k^(2*n+1)/k!.
  • A308655 (program): Alternating partial sums of the prime gaps.
  • A308663 (program): Partial sums of A097805.
  • A308668 (program): a(n) = Sum_{d|n} d^(n/d+n).
  • A308677 (program): Kuba-Panholzer Table 2 pattern 312, 213 for Stirling permutation k = 2.
  • A308685 (program): The number of triangular lattice points whose Euclidean distance from the origin is less than or equal to n.
  • A308688 (program): a(n) = Sum_{d|n} d^(2*n/d - 1).
  • A308689 (program): a(n) = Sum_{d|n} d^(3*n/d - 2).
  • A308692 (program): a(n) = Sum_{d|n} d^(2*(n/d - 1)).
  • A308693 (program): a(n) = Sum_{d|n} d^(3*(n/d - 1)).
  • A308696 (program): a(n) = Sum_{d|n} d^(2*d).
  • A308697 (program): a(n) = Sum_{d|n} d^(3*d).
  • A308700 (program): a(n) = n * 2^(n - 2) * (2^(n - 1) - 1).
  • A308707 (program): a(n) = gcd(n, phi(n) + sigma(n)), where phi is A000010 and sigma is A000203.
  • A308709 (program): Start with 3, divide by 3, multiply by 2, multiply by 3, multiply by 2, repeat.
  • A308710 (program): Primitive practical numbers of the form 2^i * prime(k).
  • A308720 (program): The maximum value in the continued fraction of sqrt(n), or 0 if there is no fractional part.
  • A308722 (program): Number of edges in the smallest possible regular graceful graph of valence n.
  • A308723 (program): Total number of parts in all m-cyclic compositions of n (where each part of size m can be colored with one of m colors).
  • A308729 (program): a(n)/n! is the expected number of left-to-right maxima in the lexicographical or colexicographical ordering of all the 2-subsets of [n] under a random permutation of [n], when the 2-subsets hold the worst order of ranks.
  • A308733 (program): Sum of the smallest parts of the partitions of n into 4 parts.
  • A308737 (program): Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.
  • A308739 (program): Decimal expansion of BesselI(1/3,2/3)/BesselI(-2/3,2/3).
  • A308740 (program): Decimal expansion of BesselI(2/3,2/3)/BesselI(-1/3,2/3).
  • A308741 (program): Decimal expansion of BesselI(1/4,1/2)/BesselI(-3/4,1/2).
  • A308742 (program): Decimal expansion of BesselI(3/4,1/2)/BesselI(-1/4,1/2).
  • A308743 (program): Decimal expansion of BesselI(1/5,2/5)/BesselI(-4/5,2/5).
  • A308747 (program): Number of achiral m-color cyclic compositions of n (that is, number of cyclic compositions of n with reflection symmetry where each part of size m can be colored with one of m colors).
  • A308753 (program): a(n) = Sum_{d|n} d^(2*(d-1)).
  • A308754 (program): a(0) = 0, a(n) = a(n-1) + 1 if 2*n + 3 is prime, otherwise a(n) = a(n-1).
  • A308755 (program): a(n) = Sum_{d|n} d^(d-2).
  • A308756 (program): a(n) = Sum_{d|n} d^(2*(d-2)).
  • A308757 (program): a(n) = Sum_{d|n} d^(3*(d-2)).
  • A308758 (program): Sum of the third largest parts of the partitions of n into 4 parts.
  • A308759 (program): Sum of the second largest parts of the partitions of n into 4 parts.
  • A308763 (program): a(n) = Sum_{d|n} d^(n-2).
  • A308775 (program): Sum of all the parts in the partitions of n into 4 parts.
  • A308806 (program): Expansion of 1 / Sum_{k>=0} (-x)^(k*(3*k - 1)/2).
  • A308807 (program): a(n) = 4*5^(n-1) + n.
  • A308808 (program): Limiting row sequence of Pascal-like triangle A141021 (with index of asymmetry s = 4).
  • A308812 (program): a(n) = Sum_{k=1..n} binomial(n,k) * floor(n/k).
  • A308814 (program): a(n) = Sum_{d|n} n^(d-1).
  • A308819 (program): Product of prime powers <= n.
  • A308820 (program): a(n) = Product_{k=1..n} ceiling(n/k)!.
  • A308822 (program): Sum of all the parts in the partitions of n into 5 parts.
  • A308823 (program): Sum of the smallest parts of the partitions of n into 5 parts.
  • A308828 (program): Number of sequences that include all residues modulo n starting with x_0 = 0 and then x_i given recursively by x_{i+1} = a * x_i + c (mod n) where a and c are integers in the interval [0..n-1].
  • A308833 (program): Numbers r such that the r-th tetrahedral number A000292(r) divides r!.
  • A308860 (program): a(n)/n! is the expected number of left-to-right maxima in the lexicographical or colexicographical ordering of all the 3-subsets of [n] under a random permutation of [n], when the 3-subsets hold the worst order of ranks.
  • A308861 (program): Expansion of e.g.f. 1/(1 - x*(1 + x)*exp(x)).
  • A308862 (program): Expansion of e.g.f. 1/(1 - x*(1 + 3*x + x^2)*exp(x)).
  • A308863 (program): Expansion of e.g.f. (1 + LambertW(-x))/(1 + 2*LambertW(-x)).
  • A308864 (program): a(n) = Sum_{k>=0} (n*k + 1)^n/2^(k+1).
  • A308865 (program): a(n) = Sum_{k>=0} k^(2*n+1)/2^(k+1).
  • A308867 (program): Sum of all the parts in the partitions of n into 6 parts.
  • A308868 (program): Sum of the smallest parts in the partitions of n into 6 parts.
  • A308874 (program): Composite numbers that are neither squares nor oblongs.
  • A308876 (program): Expansion of e.g.f. exp(x)*(1 - x)/(1 - 2*x).
  • A308877 (program): Expansion of e.g.f. (1 + log(1 - x))/(1 + 2*log(1 - x)).
  • A308878 (program): Expansion of e.g.f. (1 - log(1 + x))/(1 - 2*log(1 + x)).
  • A308898 (program): Fixed point of the morphism 0 -> 01, 1 -> 2, 2 -> 3, 3 -> 012.
  • A308900 (program): An explicit example of an infinite sequence with a(1)=1 and, for n >= 2, a(n) and S(n) = Sum_{i=1..n} a(i) have no digit in common.
  • A308901 (program): Lexicographically earliest overlap-free binary sequence.
  • A308914 (program): Number of unordered pairs of non-intersecting non-selfintersecting paths with nodes that cover all vertices of a convex n-gon, n > 3.
  • A308926 (program): Sum of all the parts in the partitions of n into 7 parts.
  • A308927 (program): Sum of the smallest parts in the partitions of n into 7 parts.
  • A308939 (program): Expansion of e.g.f. 1 / (1 - Sum_{k>=1} (2*k - 1)!!*x^k/k!).
  • A308942 (program): a(n) = Product_{k=1..n} Stirling2(n,k) * k!.
  • A308943 (program): a(n) = Product_{d|n} binomial(n,d).
  • A308944 (program): a(n) = Product_{k=1..n} lcm(n,k) / (k * gcd(n,k)).
  • A308946 (program): Expansion of e.g.f. 1/(1 - x*(1 + x/2)*exp(x)).
  • A308947 (program): a(n) = A000129(A214028(n)+1) mod n.
  • A308948 (program): a(n) = A006190(A322907(n)+1) mod n.
  • A308949 (program): a(n) is the greatest divisor of A000129(n) that is coprime to A000129(m) for all positive integers m < n.
  • A308985 (program): Expansion of Product_{k>=0} (1 + 2*x^(2^k))^2.
  • A308986 (program): Expansion of Product_{k>=0} 1/(1 + 2*x^(2^k)).
  • A308989 (program): Sum of all the parts in the partitions of n into 8 parts.
  • A308990 (program): Sum of the smallest parts in the partitions of n into 8 parts.
  • A309000 (program): Number of strings of length n from a 3-symbol alphabet (A,B,C, say) containing at least one “A” and at least two “B”s.
  • A309006 (program): Product minus sum of the two previous terms in the sequence, with a(1) = 2 and a(2) = 5.
  • A309010 (program): Square array A(n, k) = Sum_{j=0..n} binomial(n,j)^k, n >= 0, k >= 0, read by antidiagonals.
  • A309014 (program): a(n) = Sum_{k=0..n} (-1)^(n-k) * (Stirling2(n,k) mod 2).
  • A309025 (program): Expansion of x * Product_{k>=0} (1 + x^(2^k) + x^(2^(k+3))).
  • A309026 (program): Expansion of x * Product_{k>=0} (1 + x^(2^k) + x^(2^(k+4))).
  • A309027 (program): Prime powers of the form 12*c^2 + 4*c + 3, where c is an arbitrary integer.
  • A309036 (program): a(n) = gcd(A007504(n), A014285(n)).
  • A309037 (program): Exponential Demlo sequence, like 12345…54321, but for powers of 2 instead.
  • A309043 (program): Expansion of Product_{k>=0} (1 + x^(2^k) + x^(2^(k+1)))^2.
  • A309048 (program): Expansion of Product_{k>=0} (1 + x^(3^k) + x^(2*3^k) - x^(3^(k+1))).
  • A309057 (program): a(0) = 1; a(2*n) = 3*a(n), a(2*n+1) = a(n).
  • A309074 (program): a(0) = 1; a(2*n) = 4*a(n), a(2*n+1) = a(n).
  • A309075 (program): Total number of black cells after n iterations of Langton’s ant with two ants on the grid placed side-by-side on neighboring squares and initially looking in the same direction.
  • A309076 (program): The Zeckendorf representation of n read as a NegaFibonacci representation.
  • A309077 (program): Maximum sum of base lengths over all minimal factorizations of length-n binary strings.
  • A309081 (program): a(n) = n - floor(n/2^2) + floor(n/3^2) - floor(n/4^2) + …
  • A309082 (program): a(n) = n - floor(n/2^3) + floor(n/3^3) - floor(n/4^3) + …
  • A309083 (program): a(n) = n - floor(n/2^4) + floor(n/3^4) - floor(n/4^4) + …
  • A309084 (program): a(n) = exp(3) * Sum_{k>=0} (-3)^k*k^n/k!.
  • A309085 (program): a(n) = exp(4) * Sum_{k>=0} (-4)^k*k^n/k!.
  • A309091 (program): Decimal expansion of 4/(Pi-2).
  • A309093 (program): The analog of A309077(n), but allowing fractional powers.
  • A309097 (program): Number of partitions of n avoiding the partition (4,2,1).
  • A309099 (program): Number of partitions of n avoiding the partition (4,3,1).
  • A309118 (program): Number of tiles added at iteration n when successively, layer by layer, building a symmetric patch of a rhombille tiling around a central star of six rhombs.
  • A309119 (program): a(n) is the number of 1’s minus the number of 2’s among the ternary representations of the integers in the interval [0..n].
  • A309124 (program): a(n) = n - 3 * floor(n/3) + 5 * floor(n/5) - 7 * floor(n/7) + …
  • A309125 (program): a(n) = n + 2^2 * floor(n/2^2) + 3^2 * floor(n/3^2) + 4^2 * floor(n/4^2) + …
  • A309126 (program): a(n) = n + 2^3 * floor(n/2^3) + 3^3 * floor(n/3^3) + 4^3 * floor(n/4^3) + …
  • A309131 (program): Triangle read by rows: T(n, k) = (n - k)*prime(1 + k), with 0 <= k < n.
  • A309138 (program): Nonnegative integers of the form x^2 + 23*y^2.
  • A309152 (program): Numbers that can be written as the sum of two primes whose difference is also prime.
  • A309153 (program): a(n) = A000203(n)*A001227(n).
  • A309174 (program): E.g.f. A(x) satisfies: A(x) = (1/(1 - x)) * Product_{k>=2} A(x^k)^(1/k).
  • A309176 (program): a(n) = n^2 * (n + 1)/2 - Sum_{k=1..n} sigma_2(k).
  • A309192 (program): a(n) = Sum_{k=1..n} mu(k)^2 * k * floor(n/k).
  • A309198 (program): Fixed point of the morphism 1 -> 12, 2 -> 3, 3 -> 4, 4 -> 123.
  • A309212 (program): Nearest integer to (4/3)^n.
  • A309214 (program): a(0)=0; thereafter a(n) = a(n-1)+n if a(n-1) even, otherwise a(n) = a(n-1)-n.
  • A309215 (program): a(0)=0; thereafter a(n) = a(n-1)+n if a(n-1) odd, otherwise a(n) = a(n-1)-n.
  • A309220 (program): Square array A read by antidiagonals: the columns are given by A(n,1)=1, A(n,2)=n+1, A(n,3) = n^2+2n+3, A(n,4) = n^3+3*n^2+6*n+4, A(n,5) = n^4+4*n^3+10*n^2+12*n+7, …, whose coefficients are given by A104509 (see also A118981).
  • A309222 (program): a(0) = 6; thereafter a(n) = a(n-1) + prime(n) if prime(n) > a(n-1), otherwise a(n) = a(n-1) - prime(n).
  • A309231 (program): Column 3 of the array at A326662 see Comments.
  • A309243 (program): Completely multiplicative with a(p) = p * a(p-1) for any prime number p.
  • A309250 (program): a(n) is the index of the binary string of a Post’s Correspondence Problem Encoding with index n.
  • A309252 (program): a(n) is the least number not in the sequence so far and whose absolute difference from a(n-1) is not in the sequence so far, with a(1) = 1 and a(2) = 2.
  • A309255 (program): a(n) = n + 1 - Sum_{k=0..n} (Stirling1(n,k) mod 2).
  • A309256 (program): a(n) = n + 1 - Sum_{k=0..n} (Stirling2(n,k) mod 2).
  • A309265 (program): Numbers k such that s + t = k with 0 < s < t where s and t-s are both prime.
  • A309266 (program): Expansion of (1 + x) * Product_{k>=1} (1 + x^k)/(1 - x^k).
  • A309267 (program): Expansion of (1 + x) * Product_{k>=1} 1/(1 - x^k)^k.
  • A309269 (program): Numbers that are the sum of two successive prime powers.
  • A309288 (program): a(0) = 0, a(1) = 1, and for any n > 1, a(n) = Sum_{k > 1} (-1)^k * a(floor(n/k)).
  • A309294 (program): (1/2) times the sum of the elements of all subsets of [n] whose sum is divisible by two.
  • A309296 (program): (1/4) times the sum of the elements of all subsets of [n] whose sum is divisible by four.
  • A309303 (program): Expansion of g.f. (sqrt(x+1) - sqrt(1-3*x))/(2*(x+1)^(3/2)).
  • A309307 (program): Number of unitary divisors of n (excluding 1).
  • A309315 (program): Number of 5-colorings of an n-wheel graph.
  • A309322 (program): Expansion of Sum_{k>=1} phi(k) * x^k/(1 - x^k)^3, where phi = Euler totient function (A000010).
  • A309323 (program): Expansion of Sum_{k>=1} phi(k) * x^k/(1 - x^k)^4, where phi = Euler totient function (A000010).
  • A309324 (program): Expansion of Sum_{k>=1} psi(k) * x^k/(1 + x^k), where psi = Dedekind psi function (A001615).
  • A309325 (program): Numbers that are the sum of two successive palindromes.
  • A309327 (program): a(n) = Product_{k=1..n-1} (4^k + 1).
  • A309330 (program): Numbers k such that 10*k^2 + 40 is a square.
  • A309331 (program): Expansion of (x+x^3+x^5)/(1-x-3*x^3-x^5).
  • A309332 (program): Number of ways the n-th triangular number T(n) = A000217(n) can be written as the sum of two positive triangular numbers.
  • A309335 (program): a(n) = n^3 if n odd, 7*n^3/8 if n even.
  • A309336 (program): a(n) = n^4 if n odd, 15*n^4/16 if n even.
  • A309337 (program): a(n) = n^3 if n odd, 3*n^3/4 if n even.
  • A309338 (program): a(n) = n^4 if n odd, 7*n^4/8 if n even.
  • A309346 (program): Sums of two refactorable numbers.
  • A309355 (program): Even numbers k such that k! is divisible by k*(k+1)/2.
  • A309372 (program): a(n) = n^2 - n^3 + n^4.
  • A309379 (program): Number of unordered pairs of 4-colorings of an n-wheel that differ in the coloring of exactly one vertex.
  • A309380 (program): Number of unordered pairs of 5-colorings of an n-wheel that differ in the coloring of exactly one vertex.
  • A309383 (program): a(n) is the smallest b > 1 such that when c is equal to any of the first n composites the congruence b^(c-1) == 1 (mod c) is satisfied, i.e., smallest b larger than 1 such that any member of the set of smallest n composites is a base-b Fermat pseudoprime.
  • A309391 (program): a(n) = gcd(n, A064169(n-2)) for n > 2.
  • A309395 (program): Number of integer-sided triangles with sides a,b,c, max(a,b) < c, a + c = n that are right triangles.
  • A309397 (program): a(n) = gcd(n^2, A001008(n-1)) for n > 1.
  • A309398 (program): a(n) is the nearest integer to log(log(10^n)).
  • A309407 (program): a(n) = round(sqrt(3*n + 9/4)), with a(0) = 1.
  • A309416 (program): a(n) = Sum_{k > 0} d^k(n), where d^k corresponds to the k-th iterate of A296239.
  • A309419 (program): Decimal expansion of e/(e-2).
  • A309420 (program): Decimal expansion of 4/(3*Pi-8).
  • A309434 (program): a(n) = floor(n*Im(2*e^(i*Pi/5))/(Im(2*e^(i*Pi/5)) - 1)).
  • A309443 (program): Coefficients in 5-adic expansion of 4^(1/3).
  • A309444 (program): The successive approximations up to 5^n for 5-adic integer 4^(1/3).
  • A309445 (program): Coefficients in 7-adic expansion of 2^(1/5).
  • A309446 (program): Coefficients in 7-adic expansion of 3^(1/5).
  • A309448 (program): Coefficients in 7-adic expansion of 5^(1/5).
  • A309449 (program): Coefficients in 7-adic expansion of 6^(1/5).
  • A309450 (program): The successive approximations up to 7^n for 7-adic integer 2^(1/5).
  • A309451 (program): The successive approximations up to 7^n for 7-adic integer 3^(1/5).
  • A309452 (program): The successive approximations up to 7^n for 7-adic integer 4^(1/5).
  • A309453 (program): The successive approximations up to 7^n for 7-adic integer 5^(1/5).
  • A309454 (program): The successive approximations up to 7^n for 7-adic integer 6^(1/5).
  • A309462 (program): Limiting row sequence for Pascal-like triangle A140995 (Stepan’s triangle with index of asymmetry s = 3).
  • A309472 (program): a(n) = n^n - n * n!.
  • A309474 (program): Digits of one of the two 3-adic integers sqrt(-1/2).
  • A309475 (program): Digits of one of the two 3-adic integers sqrt(-1/2). Here the sequence with first digit 2.
  • A309476 (program): One of the two successive approximations up to 3^n for the 3-adic integer sqrt(-1/2).
  • A309477 (program): One of the two successive approximations up to 3^n for the 3-adic integer sqrt(-1/2).
  • A309490 (program): Total number of adjacent node merge operations to turn a circular list of size n to a node.
  • A309491 (program): Let gcd_2(b,c) be the second-largest common divisor of non-coprime integers b and c; then a(n) = Sum_{k=1..n} gcd_2(k,n). If b and c are coprime, then gcd_2(b,c) = 0.
  • A309492 (program): a(1) = a(2) = 1, a(3) = 3, a(4) = 5, a(5) = 2; a(n) = a(n-a(n-2)) + a(n-a(n-3)) for n > 5.
  • A309498 (program): Least number k > 0 such that 4*p^2*k^2 + 1 is prime, where p = prime(n) is the n-th prime.
  • A309507 (program): Number of ways the n-th triangular number T(n) = A000217(n) can be written as the difference of two positive triangular numbers.
  • A309511 (program): Number of odd parts in the partitions of n into 3 parts.
  • A309513 (program): Number of even parts in the partitions of n into 3 parts.
  • A309525 (program): a(n) is the greatest divisor of A006190(n) that is coprime to A006190(m) for all positive integers m < n.
  • A309526 (program): a(n) is the greatest divisor of A001353(n) that is coprime to A001353(m) for all positive integers m < n.
  • A309535 (program): Total number of square parts in all compositions of n.
  • A309536 (program): Total number of triangular numbers in all compositions of n.
  • A309537 (program): Total number of Fibonacci parts in all compositions of n.
  • A309538 (program): Total number of factorial parts in all compositions of n.
  • A309555 (program): Triangle read by rows: T(n,k) = 3 + k*(n-k) for n >= 0, 0 <= k <= n.
  • A309557 (program): Number triangle with T(n,k) = 2 + 3*n - 2*k + 2*k*(n-k) for n >= 0, 0 <= k <= n.
  • A309559 (program): Triangle read by rows: T(n,k) = 1 + n + k^2/2 - k/2 + k*(n-k), n >= 0, 0 <= k <= n.
  • A309561 (program): Total sum of prime parts in all compositions of n.
  • A309574 (program): n-th prime minus its ternary (base 3) reversal.
  • A309575 (program): Expansion of Product_{k>=1} (1 - (x*(1 + x))^k).
  • A309579 (program): Maximum principal ratio of a strongly connected digraph on n nodes.
  • A309580 (program): Primes p with 1 zero in a fundamental period of A000129 mod p.
  • A309581 (program): Primes p with 2 zeros in a fundamental period of A000129 mod p.
  • A309583 (program): Numbers k with 1 zero in a fundamental period of A000129 mod k.
  • A309585 (program): Numbers k with 4 zeros in a fundamental period of A000129 mod k.
  • A309591 (program): Numbers k with 1 zero in a fundamental period of A006190 mod k.
  • A309593 (program): Numbers k with 4 zeros in a fundamental period of A006190 mod k.
  • A309616 (program): a(n) is the number of ways to represent 2*n in the decibinary system.
  • A309618 (program): a(n) = Sum_{k=0..floor(n/2)} k! * 2^k * (n - 2*k)!.
  • A309619 (program): a(n) = Sum_{k=0..floor(n/2)} k! * (n - 2*k)!.
  • A309649 (program): Sieved recursive primeth recurrence (see Comments for precise definition).
  • A309665 (program): a(1)=1; for n > 1, a(n) = a(n-1)/gcd(a(n-1),n) + n + 1.
  • A309674 (program): a(1) = 1, a(n) = hamming_weight(Sum_{k=1..n-1} a(k) ) for n>=2.
  • A309675 (program): a(n) = 4^n^2 + n!.
  • A309676 (program): Number of compositions (ordered partitions) of n into odd primes (including 1).
  • A309677 (program): G.f. A(x) satisfies: A(x) = A(x^3) / (1 - x)^2.
  • A309678 (program): G.f. A(x) satisfies: A(x) = A(x^4) / (1 - x)^2.
  • A309679 (program): G.f. A(x) satisfies: A(x) = A(x^5) / (1 - x)^2.
  • A309683 (program): Number of odd parts appearing among the smallest parts of the partitions of n into 3 parts.
  • A309684 (program): Sum of the odd parts appearing among the smallest parts of the partitions of n into 3 parts.
  • A309685 (program): Number of even parts appearing among the smallest parts of the partitions of n into 3 parts.
  • A309686 (program): Sum of the even parts appearing among the smallest parts of the partitions of n into 3 parts.
  • A309687 (program): Number of odd parts appearing among the second largest parts of the partitions of n into 3 parts.
  • A309688 (program): Sum of the odd parts appearing among the second largest parts of the partitions of n into 3 parts.
  • A309689 (program): Number of even parts appearing among the second largest parts of the partitions of n into 3 parts.
  • A309690 (program): Sum of the even parts appearing among the second largest parts of the partitions of n into 3 parts.
  • A309697 (program): a(n) is the digit that precedes the last nonzero digit of n^n.
  • A309698 (program): Digits of the 4-adic integer 3^(1/3).
  • A309700 (program): Digits of the 8-adic integer 7^(1/7).
  • A309702 (program): G.f. A(x) satisfies: A(x) = A(x^2) / (1 - x - x^2 - x^3).
  • A309705 (program): a(n) = lcm(a(n-1), n) - gcd(a(n-1), n) where a(1) = 1.
  • A309709 (program): Number of binary digits that change when n is multiplied by 4.
  • A309714 (program): The smallest possible nonnegative difference between the sum of the first n positive integers (A000217) and the sum of any number of the directly following and consecutive integers.
  • A309715 (program): Number of even parts appearing among the third largest parts of the partitions of n into 4 parts.
  • A309722 (program): Digits of the 4-adic integer (1/3)^(1/3).
  • A309724 (program): Digits of the 8-adic integer (1/7)^(1/7).
  • A309725 (program): Number of set partitions of {1,2,…,3n} with sizes in {[n, n, n], [2n, n], [3n]}.
  • A309726 (program): Numbers n such that n^2 - 12 is prime.
  • A309728 (program): G.f. A(x) satisfies: A(x) = A(x^2) / (1 - 2*x).
  • A309729 (program): Expansion of Sum_{k>=1} x^k/(1 - x^k - 2*x^(2*k)).
  • A309730 (program): Expansion of Sum_{k>=1} x^k * (1 - x^(3*k))/(1 - x^k)^4.
  • A309731 (program): Expansion of Sum_{k>=1} k * x^k/(1 - x^k)^3.
  • A309732 (program): Expansion of Sum_{k>=1} k^2 * x^k/(1 - x^k)^3.
  • A309750 (program): Number of letters in the English names of the months when the names are arranged in alphabetical order.
  • A309758 (program): Numbers that are sums of consecutive powers of 3.
  • A309759 (program): Numbers that are sums of consecutive powers of 4.
  • A309760 (program): Even numbers k such that k-p is composite where p is the largest prime <= k.
  • A309761 (program): Numbers that are sums of consecutive powers of 10.
  • A309772 (program): Least common multiple of prime(n+1)+1 and prime(n)+1.
  • A309773 (program): n directly precedes a(n) in Sharkovskii ordering.
  • A309775 (program): Expansion of e.g.f. exp(2 * (1 - exp(x)) + x).
  • A309779 (program): Squares that can be expressed as the sum of two positive squares but not as the sum of three positive squares.
  • A309786 (program): a(n) is the length of the cycle of the trajectory of 1/n under the map f(x) = min(2*x, 2-2*x).
  • A309788 (program): Product of digits of (n written in base 9).
  • A309790 (program): G.f. A(x) satisfies: A(x) = 2*x*(1 - x)*A(x^2) + x/(1 - x).
  • A309792 (program): Expansion of (2 + 6*x + 3*x^2 +4*x^3 - 10*x^4)/(1 - x - 4*x^4 + 4*x^5).
  • A309801 (program): If 2*n = Sum (2^e_k) then a(n) = Sum (e_k^n).
  • A309805 (program): Maximum number of nonattacking kings placeable on a hexagonal board with edge-length n in Glinski’s hexagonal chess.
  • A309808 (program): Primes formed by concatenating k and 2k+1.
  • A309809 (program): a(n) is the concatenation of n and 2n+1.
  • A309812 (program): Odd integers k such that k^2 is arithmetic mean of two other perfect squares.
  • A309816 (program): a(n) is the 2-adic valuation of A014664(n).
  • A309827 (program): a(n) is the square of the number consisting of one 1 and n 6’s: (166…6)^2.
  • A309831 (program): Number of even parts appearing among the smallest parts of the partitions of n into 5 parts.
  • A309840 (program): If n = Sum (2^e_k) then a(n) = Product (Fibonacci(e_k + 3)).
  • A309841 (program): If n = Sum (2^e_k) then a(n) = Product ((e_k + 2)!).
  • A309842 (program): a(n) is the total surface area of a hollow cubic block (defined as a block with a shell thickness of 1 cube) where n is the edge length of the removed volume.
  • A309845 (program): Expansion of e.g.f.: sec(x) + 2*tan(x).
  • A309867 (program): Expansion of Product_{k>0} (1+sqrt(1-4*x^k))/2.
  • A309873 (program): Period-doubling turn sequence, +1 when the 2-adic valuation of n is even or -1 when odd.
  • A309874 (program): a(n) = 2*n*Fibonacci(n-2) + (-1)^n + 1.
  • A309878 (program): The real part of b(n) where b(n) = (n + b(n-1)) * (1 + i) with b(-1)=0; i = sqrt(-1).
  • A309891 (program): a(n) is the total number of trailing zeros in the representations of n over all bases b >= 2.
  • A309892 (program): a(0) = 0, a(1) = 1, and for any n > 1, a(n) is the number of iterations of the map x -> x - gpf(x) (where gpf(x) denotes the greatest prime factor of x) required to reach 0 starting from n.
  • A309907 (program): a(n) is the square of the number consisting of one 1 and n 3’s: (133…3)^2.
  • A309914 (program): Distance from n to closest triangular number that is different from n.
  • A309945 (program): a(n) = floor(n - sqrt(2*n-1)).
  • A309948 (program): Decimal expansion of the real part of the square root of 1 + i.
  • A309949 (program): Decimal expansion of the imaginary part of the square root of 1 + i.
  • A309952 (program): XOR contraction of binary representation of n.
  • A309953 (program): Product of digits of (n written in base 3).
  • A309954 (program): Product of digits of (n written in base 4).
  • A309956 (program): Product of digits of (n written in base 5).
  • A309957 (program): Product of digits of (n written in base 6).
  • A309958 (program): Product of digits of (n written in base 7).
  • A309959 (program): Product of digits of (n written in base 8).
  • A309970 (program): Period 12: repeat [1, 1, 0, 0, -1, -1, -1, -1, 0, 0, 1, 1].
  • A309976 (program): Vacation Dyck paths. Discrete analog for vacation M/M/1 queue embedded chain.
  • A309978 (program): a(n) is the number of positive integers k such that there exists a nonnegative integer m with k + k^m = n.
  • A309983 (program): Numbers n resulting from adding the exponents of 2 associated with the “1” terms of their binary representation and subtracting the exponents of 2 associated with the “0” terms of their binary representation.
  • A309989 (program): Digits of one of the two 17-adic integers sqrt(-1).
  • A309990 (program): Digits of one of the two 17-adic integers sqrt(-1).
  • A309991 (program): Balanced quinary (base 5) enumeration (or balanced quinary representation) of integers, write n in quinary, and then replace 3’s with (-2)’s and 4’s with (-1)’s.
  • A309995 (program): Balanced septenary enumeration (or balanced septenary representation) of integers; write n in septenary and then replace 4’s with (-3),s, 5’s with (-2)’s, and 6’s with (-1)’s.
  • A310185 (program): Coordination sequence Gal.4.15.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310215 (program): Coordination sequence Gal.3.2.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310238 (program): Coordination sequence Gal.4.7.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310341 (program): Coordination sequence Gal.6.527.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310342 (program): Coordination sequence Gal.5.253.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310367 (program): Coordination sequence Gal.6.129.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310368 (program): Coordination sequence Gal.6.230.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310369 (program): Coordination sequence Gal.5.64.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310370 (program): Coordination sequence Gal.5.109.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310371 (program): Coordination sequence Gal.6.258.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310372 (program): Coordination sequence Gal.4.52.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310373 (program): Coordination sequence Gal.6.150.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310374 (program): Coordination sequence Gal.6.245.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310375 (program): Coordination sequence Gal.5.82.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310378 (program): Coordination sequence Gal.6.320.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310379 (program): Coordination sequence Gal.6.321.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310380 (program): Coordination sequence Gal.6.322.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310393 (program): Coordination sequence Gal.6.193.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310396 (program): Coordination sequence Gal.6.320.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310397 (program): Coordination sequence Gal.4.76.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310398 (program): Coordination sequence Gal.5.136.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310400 (program): Coordination sequence Gal.6.337.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310404 (program): Coordination sequence Gal.6.338.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310405 (program): Coordination sequence Gal.6.339.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310408 (program): Coordination sequence Gal.6.196.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310409 (program): Coordination sequence Gal.3.19.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310410 (program): Coordination sequence Gal.6.344.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310411 (program): Coordination sequence Gal.4.72.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310412 (program): Coordination sequence Gal.5.129.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310413 (program): Coordination sequence Gal.6.323.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310416 (program): Coordination sequence Gal.6.367.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310419 (program): Coordination sequence Gal.5.130.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310420 (program): Coordination sequence Gal.6.324.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310421 (program): Coordination sequence Gal.5.131.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310422 (program): Coordination sequence Gal.6.325.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310423 (program): Coordination sequence Gal.6.326.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310438 (program): Coordination sequence Gal.6.194.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310439 (program): Coordination sequence Gal.6.321.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310440 (program): Coordination sequence Gal.6.202.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310441 (program): Coordination sequence Gal.4.77.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310442 (program): Coordination sequence Gal.6.327.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310444 (program): Coordination sequence Gal.6.340.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310446 (program): Coordination sequence Gal.5.137.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310452 (program): Coordination sequence Gal.6.195.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310454 (program): Coordination sequence Gal.5.140.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310455 (program): Coordination sequence Gal.6.348.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310456 (program): Coordination sequence Gal.6.322.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310457 (program): Coordination sequence Gal.6.345.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310458 (program): Coordination sequence Gal.4.78.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310459 (program): Coordination sequence Gal.6.341.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310461 (program): Coordination sequence Gal.6.350.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310462 (program): Coordination sequence Gal.5.138.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310464 (program): Coordination sequence Gal.5.139.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310465 (program): Coordination sequence Gal.6.342.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310466 (program): Coordination sequence Gal.6.343.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310469 (program): Coordination sequence Gal.5.141.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310470 (program): Coordination sequence Gal.6.349.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310471 (program): Coordination sequence Gal.6.346.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310472 (program): Coordination sequence Gal.6.347.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310491 (program): Coordination sequence Gal.6.154.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310492 (program): Coordination sequence Gal.6.249.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310493 (program): Coordination sequence Gal.5.86.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310496 (program): Coordination sequence Gal.6.327.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310498 (program): Coordination sequence Gal.3.20.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310499 (program): Coordination sequence Gal.6.351.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310501 (program): Coordination sequence Gal.6.328.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310502 (program): Coordination sequence Gal.5.132.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310503 (program): Coordination sequence Gal.4.73.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310504 (program): Coordination sequence Gal.6.329.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310505 (program): Coordination sequence Gal.6.330.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310509 (program): Coordination sequence Gal.5.142.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310511 (program): Coordination sequence Gal.6.354.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310512 (program): Coordination sequence Gal.6.352.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310513 (program): Coordination sequence Gal.6.353.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310517 (program): Coordination sequence Gal.6.206.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310518 (program): Coordination sequence Gal.3.21.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310520 (program): Coordination sequence Gal.6.331.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310521 (program): Coordination sequence Gal.5.133.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310523 (program): Coordination sequence Gal.6.355.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310524 (program): Coordination sequence Gal.6.356.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310525 (program): Coordination sequence Gal.4.74.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310526 (program): Coordination sequence Gal.6.332.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310529 (program): Coordination sequence Gal.4.75.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310530 (program): Coordination sequence Gal.5.134.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310531 (program): Coordination sequence Gal.5.135.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310532 (program): Coordination sequence Gal.6.333.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310533 (program): Coordination sequence Gal.6.334.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310538 (program): Coordination sequence Gal.6.215.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310564 (program): Coordination sequence Gal.3.23.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310565 (program): Coordination sequence Gal.4.82.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310704 (program): Coordination sequence Gal.3.2.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A310725 (program): Coordination sequence Gal.5.19.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311101 (program): Coordination sequence Gal.3.47.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311196 (program): Coordination sequence Gal.6.115.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311225 (program): Coordination sequence Gal.6.216.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311257 (program): Coordination sequence Gal.6.115.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311262 (program): Coordination sequence Gal.6.216.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311285 (program): Coordination sequence Gal.4.70.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311287 (program): Coordination sequence Gal.4.50.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311289 (program): Coordination sequence Gal.5.107.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311290 (program): Coordination sequence Gal.5.62.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311312 (program): Coordination sequence Gal.6.118.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311331 (program): Coordination sequence Gal.6.119.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311332 (program): Coordination sequence Gal.6.120.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311344 (program): Coordination sequence Gal.5.95.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311356 (program): Coordination sequence Gal.6.219.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311366 (program): Coordination sequence Gal.6.288.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311384 (program): Coordination sequence Gal.6.220.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311385 (program): Coordination sequence Gal.6.221.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311426 (program): Coordination sequence Gal.6.115.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311433 (program): Coordination sequence Gal.5.97.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311434 (program): Coordination sequence Gal.6.216.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311440 (program): Coordination sequence Gal.5.50.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311458 (program): Coordination sequence Gal.5.95.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311475 (program): Coordination sequence Gal.6.118.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311481 (program): Coordination sequence Gal.6.219.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311501 (program): Coordination sequence Gal.4.38.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311512 (program): Coordination sequence Gal.6.130.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311523 (program): Coordination sequence Gal.6.119.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311535 (program): Coordination sequence Gal.5.53.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311536 (program): Coordination sequence Gal.6.120.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311541 (program): Coordination sequence Gal.6.221.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311548 (program): Coordination sequence Gal.5.54.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311549 (program): Coordination sequence Gal.6.132.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311552 (program): Coordination sequence Gal.5.55.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311553 (program): Coordination sequence Gal.6.133.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311554 (program): Coordination sequence Gal.6.134.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311586 (program): Coordination sequence Gal.4.58.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311593 (program): Coordination sequence Gal.6.192.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311601 (program): Coordination sequence Gal.6.230.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311612 (program): Coordination sequence Gal.5.98.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311613 (program): Coordination sequence Gal.6.231.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311625 (program): Coordination sequence Gal.5.99.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311626 (program): Coordination sequence Gal.6.232.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311633 (program): Coordination sequence Gal.5.100.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311634 (program): Coordination sequence Gal.6.233.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311635 (program): Coordination sequence Gal.6.234.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311683 (program): Coordination sequence Gal.6.419.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311687 (program): Coordination sequence Gal.6.125.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311705 (program): Coordination sequence Gal.4.89.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311709 (program): Coordination sequence Gal.4.121.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311710 (program): Coordination sequence Gal.4.68.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311801 (program): Coordination sequence Gal.6.115.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311804 (program): Coordination sequence Gal.6.216.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311806 (program): Coordination sequence Gal.4.60.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311807 (program): Coordination sequence Gal.3.12.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311816 (program): Coordination sequence Gal.5.95.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311843 (program): Coordination sequence Gal.4.38.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311861 (program): Coordination sequence Gal.6.130.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311889 (program): Coordination sequence Gal.6.129.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311914 (program): Coordination sequence Gal.4.58.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311924 (program): Coordination sequence Gal.6.118.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311931 (program): Coordination sequence Gal.3.17.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311932 (program): Coordination sequence Gal.6.192.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311943 (program): Coordination sequence Gal.4.80.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311958 (program): Coordination sequence Gal.5.53.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311964 (program): Coordination sequence Gal.6.131.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311993 (program): Coordination sequence Gal.5.98.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A311994 (program): Coordination sequence Gal.6.231.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312065 (program): Coordination sequence Gal.3.10.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312068 (program): Coordination sequence Gal.6.119.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312077 (program): Coordination sequence Gal.5.65.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312100 (program): Coordination sequence Gal.5.54.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312101 (program): Coordination sequence Gal.6.150.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312113 (program): Coordination sequence Gal.6.132.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312123 (program): Coordination sequence Gal.6.120.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312125 (program): Coordination sequence Gal.6.221.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312140 (program): Coordination sequence Gal.4.41.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312143 (program): Coordination sequence Gal.5.55.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312144 (program): Coordination sequence Gal.6.151.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312151 (program): Coordination sequence Gal.6.133.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312152 (program): Coordination sequence Gal.6.134.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312160 (program): Coordination sequence Gal.5.100.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312162 (program): Coordination sequence Gal.6.233.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312163 (program): Coordination sequence Gal.6.234.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312183 (program): Coordination sequence Gal.4.42.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312184 (program): Coordination sequence Gal.6.155.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312185 (program): Coordination sequence Gal.6.154.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312194 (program): Coordination sequence Gal.6.156.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312195 (program): Coordination sequence Gal.5.67.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312205 (program): Coordination sequence Gal.4.43.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312206 (program): Coordination sequence Gal.6.157.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312207 (program): Coordination sequence Gal.5.68.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312208 (program): Coordination sequence Gal.5.69.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312209 (program): Coordination sequence Gal.6.158.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312210 (program): Coordination sequence Gal.6.159.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312245 (program): Coordination sequence Gal.3.31.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312289 (program): Coordination sequence Gal.6.527.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312472 (program): Coordination sequence Gal.6.149.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312475 (program): Coordination sequence Gal.3.16.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312484 (program): Coordination sequence Gal.5.81.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312506 (program): Coordination sequence Gal.5.109.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312507 (program): Coordination sequence Gal.6.245.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312526 (program): Coordination sequence Gal.6.254.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312549 (program): Coordination sequence Gal.4.61.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312555 (program): Coordination sequence Gal.5.110.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312556 (program): Coordination sequence Gal.6.246.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312561 (program): Coordination sequence Gal.6.247.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312562 (program): Coordination sequence Gal.6.248.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312606 (program): Coordination sequence Gal.6.255.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312620 (program): Coordination sequence Gal.6.256.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312655 (program): Coordination sequence Gal.4.62.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312656 (program): Coordination sequence Gal.6.201.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312658 (program): Coordination sequence Gal.6.249.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312668 (program): Coordination sequence Gal.6.250.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312669 (program): Coordination sequence Gal.5.111.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312680 (program): Coordination sequence Gal.4.63.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312681 (program): Coordination sequence Gal.6.251.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312682 (program): Coordination sequence Gal.5.112.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312683 (program): Coordination sequence Gal.5.113.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312684 (program): Coordination sequence Gal.6.252.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312685 (program): Coordination sequence Gal.6.253.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312839 (program): Coordination sequence Gal.4.12.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312890 (program): Coordination sequence Gal.6.115.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312891 (program): Coordination sequence Gal.6.216.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312892 (program): Coordination sequence Gal.5.50.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312893 (program): Coordination sequence Gal.5.95.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312894 (program): Coordination sequence Gal.4.38.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312895 (program): Coordination sequence Gal.4.58.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312896 (program): Coordination sequence Gal.6.130.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312897 (program): Coordination sequence Gal.6.192.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312901 (program): Coordination sequence Gal.3.10.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312902 (program): Coordination sequence Gal.6.129.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312903 (program): Coordination sequence Gal.5.65.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312908 (program): Coordination sequence Gal.5.64.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312909 (program): Coordination sequence Gal.6.150.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312926 (program): Coordination sequence Gal.6.118.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312927 (program): Coordination sequence Gal.6.149.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312928 (program): Coordination sequence Gal.3.16.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312932 (program): Coordination sequence Gal.5.81.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312933 (program): Coordination sequence Gal.6.131.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312935 (program): Coordination sequence Gal.4.105.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312938 (program): Coordination sequence Gal.5.127.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312941 (program): Coordination sequence Gal.5.14.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312943 (program): Coordination sequence Gal.4.41.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312944 (program): Coordination sequence Gal.6.245.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312948 (program): Coordination sequence Gal.5.66.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312950 (program): Coordination sequence Gal.6.151.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312960 (program): Coordination sequence Gal.4.106.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312961 (program): Coordination sequence Gal.6.152.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312963 (program): Coordination sequence Gal.6.153.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312969 (program): Coordination sequence Gal.6.254.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312974 (program): Coordination sequence Gal.4.61.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312975 (program): Coordination sequence Gal.5.110.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312976 (program): Coordination sequence Gal.6.246.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312979 (program): Coordination sequence Gal.6.247.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312980 (program): Coordination sequence Gal.6.248.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312981 (program): Coordination sequence Gal.5.146.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312983 (program): Coordination sequence Gal.3.25.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A312998 (program): Coordination sequence Gal.4.85.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313023 (program): Coordination sequence Gal.6.130.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313024 (program): Coordination sequence Gal.6.119.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313025 (program): Coordination sequence Gal.5.65.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313026 (program): Coordination sequence Gal.5.54.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313031 (program): Coordination sequence Gal.6.258.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313045 (program): Coordination sequence Gal.6.258.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313046 (program): Coordination sequence Gal.6.454.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313051 (program): Coordination sequence Gal.3.33.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313053 (program): Coordination sequence Gal.5.114.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313054 (program): Coordination sequence Gal.6.318.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313057 (program): Coordination sequence Gal.6.132.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313062 (program): Coordination sequence Gal.6.154.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313064 (program): Coordination sequence Gal.6.195.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313076 (program): Coordination sequence Gal.6.156.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313078 (program): Coordination sequence Gal.5.67.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313088 (program): Coordination sequence Gal.6.120.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313089 (program): Coordination sequence Gal.6.221.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313090 (program): Coordination sequence Gal.5.114.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313099 (program): Coordination sequence Gal.6.259.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313100 (program): Coordination sequence Gal.5.100.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313103 (program): Coordination sequence Gal.6.260.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313110 (program): Coordination sequence Gal.3.13.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313113 (program): Coordination sequence Gal.6.133.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313115 (program): Coordination sequence Gal.4.43.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313116 (program): Coordination sequence Gal.5.116.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313117 (program): Coordination sequence Gal.6.134.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313118 (program): Coordination sequence Gal.6.234.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313119 (program): Coordination sequence Gal.6.157.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313124 (program): Coordination sequence Gal.6.250.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313125 (program): Coordination sequence Gal.5.111.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313126 (program): Coordination sequence Gal.6.198.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313127 (program): Coordination sequence Gal.5.69.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313128 (program): Coordination sequence Gal.6.158.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313129 (program): Coordination sequence Gal.6.159.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313136 (program): Coordination sequence Gal.6.256.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313137 (program): Coordination sequence Gal.6.263.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313144 (program): Coordination sequence Gal.5.219.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313145 (program): Coordination sequence Gal.6.264.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313147 (program): Coordination sequence Gal.4.63.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313148 (program): Coordination sequence Gal.6.251.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313152 (program): Coordination sequence Gal.5.112.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313154 (program): Coordination sequence Gal.6.252.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313155 (program): Coordination sequence Gal.6.253.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313174 (program): Coordination sequence Gal.6.478.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313193 (program): Coordination sequence Gal.4.106.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313201 (program): Coordination sequence Gal.5.115.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313212 (program): Coordination sequence Gal.6.263.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313213 (program): Coordination sequence Gal.6.260.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313228 (program): Coordination sequence Gal.6.155.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313229 (program): Coordination sequence Gal.6.201.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313232 (program): Coordination sequence Gal.3.14.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313237 (program): Coordination sequence Gal.6.202.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313241 (program): Coordination sequence Gal.5.86.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313246 (program): Coordination sequence Gal.6.264.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313247 (program): Coordination sequence Gal.6.261.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313251 (program): Coordination sequence Gal.6.203.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313255 (program): Coordination sequence Gal.5.87.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313258 (program): Coordination sequence Gal.4.54.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313259 (program): Coordination sequence Gal.6.204.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313262 (program): Coordination sequence Gal.6.205.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313276 (program): Coordination sequence Gal.6.265.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313280 (program): Coordination sequence Gal.3.15.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313281 (program): Coordination sequence Gal.6.206.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313283 (program): Coordination sequence Gal.6.207.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313284 (program): Coordination sequence Gal.5.88.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313289 (program): Coordination sequence Gal.4.55.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313290 (program): Coordination sequence Gal.6.208.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313292 (program): Coordination sequence Gal.4.56.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313293 (program): Coordination sequence Gal.5.89.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313295 (program): Coordination sequence Gal.5.90.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313296 (program): Coordination sequence Gal.6.209.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313297 (program): Coordination sequence Gal.6.210.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313416 (program): Coordination sequence Gal.4.106.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313474 (program): Coordination sequence Gal.6.118.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313475 (program): Coordination sequence Gal.6.119.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313476 (program): Coordination sequence Gal.5.53.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313477 (program): Coordination sequence Gal.5.54.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313480 (program): Coordination sequence Gal.4.41.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313485 (program): Coordination sequence Gal.6.254.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313487 (program): Coordination sequence Gal.4.42.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313494 (program): Coordination sequence Gal.6.155.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313498 (program): Coordination sequence Gal.6.255.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313506 (program): Coordination sequence Gal.5.114.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313510 (program): Coordination sequence Gal.3.13.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313514 (program): Coordination sequence Gal.6.154.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313515 (program): Coordination sequence Gal.6.264.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313519 (program): Coordination sequence Gal.6.196.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313525 (program): Coordination sequence Gal.6.249.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313533 (program): Coordination sequence Gal.6.131.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313534 (program): Coordination sequence Gal.6.231.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313537 (program): Coordination sequence Gal.5.66.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313538 (program): Coordination sequence Gal.5.110.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313540 (program): Coordination sequence Gal.6.151.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313543 (program): Coordination sequence Gal.6.196.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313546 (program): Coordination sequence Gal.6.156.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313556 (program): Coordination sequence Gal.6.132.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313560 (program): Coordination sequence Gal.6.201.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313561 (program): Coordination sequence Gal.4.53.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313565 (program): Coordination sequence Gal.5.219.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313568 (program): Coordination sequence Gal.3.14.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313569 (program): Coordination sequence Gal.6.197.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313572 (program): Coordination sequence Gal.6.250.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313575 (program): Coordination sequence Gal.6.202.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313580 (program): Coordination sequence Gal.5.111.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313581 (program): Coordination sequence Gal.4.57.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313583 (program): Coordination sequence Gal.6.345.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313589 (program): Coordination sequence Gal.5.141.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313591 (program): Coordination sequence Gal.6.346.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313592 (program): Coordination sequence Gal.6.347.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313610 (program): Coordination sequence Gal.5.136.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313611 (program): Coordination sequence Gal.6.337.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313613 (program): Coordination sequence Gal.4.72.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313614 (program): Coordination sequence Gal.5.129.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313615 (program): Coordination sequence Gal.6.323.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313616 (program): Coordination sequence Gal.4.57.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313619 (program): Coordination sequence Gal.6.260.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313620 (program): Coordination sequence Gal.6.348.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313622 (program): Coordination sequence Gal.6.203.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313623 (program): Coordination sequence Gal.5.87.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313635 (program): Coordination sequence Gal.4.54.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313639 (program): Coordination sequence Gal.6.204.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313646 (program): Coordination sequence Gal.6.205.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313680 (program): Coordination sequence Gal.6.120.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313681 (program): Coordination sequence Gal.6.221.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313682 (program): Coordination sequence Gal.5.55.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313683 (program): Coordination sequence Gal.5.100.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313684 (program): Coordination sequence Gal.6.259.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313685 (program): Coordination sequence Gal.4.43.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313687 (program): Coordination sequence Gal.6.202.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313688 (program): Coordination sequence Gal.6.151.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313689 (program): Coordination sequence Gal.6.152.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313692 (program): Coordination sequence Gal.5.136.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313693 (program): Coordination sequence Gal.6.197.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313694 (program): Coordination sequence Gal.4.63.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313696 (program): Coordination sequence Gal.6.327.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313698 (program): Coordination sequence Gal.6.157.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313702 (program): Coordination sequence Gal.6.337.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313703 (program): Coordination sequence Gal.5.129.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313704 (program): Coordination sequence Gal.6.323.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313707 (program): Coordination sequence Gal.6.198.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313711 (program): Coordination sequence Gal.6.251.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313717 (program): Coordination sequence Gal.6.151.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313718 (program): Coordination sequence Gal.6.133.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313719 (program): Coordination sequence Gal.5.116.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313720 (program): Coordination sequence Gal.6.153.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313721 (program): Coordination sequence Gal.5.129.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313722 (program): Coordination sequence Gal.6.248.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313726 (program): Coordination sequence Gal.6.340.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313729 (program): Coordination sequence Gal.6.134.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313730 (program): Coordination sequence Gal.6.234.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313735 (program): Coordination sequence Gal.6.646.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313737 (program): Coordination sequence Gal.6.363.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313738 (program): Coordination sequence Gal.6.158.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313739 (program): Coordination sequence Gal.6.159.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313740 (program): Coordination sequence Gal.5.309.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313744 (program): Coordination sequence Gal.6.345.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313745 (program): Coordination sequence Gal.6.199.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313746 (program): Coordination sequence Gal.5.113.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313747 (program): Coordination sequence Gal.6.200.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313752 (program): Coordination sequence Gal.5.300.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313753 (program): Coordination sequence Gal.6.253.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313754 (program): Coordination sequence Gal.4.142.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313768 (program): Coordination sequence Gal.6.261.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313769 (program): Coordination sequence Gal.6.339.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313772 (program): Coordination sequence Gal.6.328.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313773 (program): Coordination sequence Gal.5.131.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313774 (program): Coordination sequence Gal.6.622.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313778 (program): Coordination sequence Gal.6.203.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313779 (program): Coordination sequence Gal.6.328.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313780 (program): Coordination sequence Gal.3.23.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313781 (program): Coordination sequence Gal.6.617.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313782 (program): Coordination sequence Gal.5.289.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313786 (program): Coordination sequence Gal.4.128.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313788 (program): Coordination sequence Gal.6.326.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313789 (program): Coordination sequence Gal.6.208.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313791 (program): Coordination sequence Gal.6.354.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313793 (program): Coordination sequence Gal.4.134.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313794 (program): Coordination sequence Gal.6.619.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313795 (program): Coordination sequence Gal.6.647.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313799 (program): Coordination sequence Gal.3.53.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313801 (program): Coordination sequence Gal.5.291.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313802 (program): Coordination sequence Gal.6.209.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313803 (program): Coordination sequence Gal.6.210.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313811 (program): Coordination sequence Gal.6.649.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313813 (program): Coordination sequence Gal.5.309.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313814 (program): Coordination sequence Gal.5.314.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313824 (program): Coordination sequence Gal.6.195.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313825 (program): Coordination sequence Gal.6.322.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313826 (program): Coordination sequence Gal.4.78.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313827 (program): Coordination sequence Gal.5.141.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313829 (program): Coordination sequence Gal.6.203.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313831 (program): Coordination sequence Gal.6.328.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313833 (program): Coordination sequence Gal.6.341.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313834 (program): Coordination sequence Gal.6.616.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313835 (program): Coordination sequence Gal.5.299.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313836 (program): Coordination sequence Gal.3.23.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313837 (program): Coordination sequence Gal.6.618.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313838 (program): Coordination sequence Gal.6.649.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313842 (program): Coordination sequence Gal.5.289.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313846 (program): Coordination sequence Gal.5.308.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313849 (program): Coordination sequence Gal.5.309.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313853 (program): Coordination sequence Gal.6.156.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313854 (program): Coordination sequence Gal.6.250.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313855 (program): Coordination sequence Gal.5.87.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313859 (program): Coordination sequence Gal.6.340.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313860 (program): Coordination sequence Gal.5.132.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313862 (program): Coordination sequence Gal.6.354.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313869 (program): Coordination sequence Gal.6.206.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313872 (program): Coordination sequence Gal.6.617.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313873 (program): Coordination sequence Gal.3.21.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313875 (program): Coordination sequence Gal.4.134.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313876 (program): Coordination sequence Gal.6.342.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313877 (program): Coordination sequence Gal.6.646.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313878 (program): Coordination sequence Gal.6.647.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313879 (program): Coordination sequence Gal.6.343.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313884 (program): Coordination sequence Gal.6.347.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313886 (program): Coordination sequence Gal.4.143.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313887 (program): Coordination sequence Gal.6.331.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313888 (program): Coordination sequence Gal.5.311.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313889 (program): Coordination sequence Gal.6.652.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313890 (program): Coordination sequence Gal.6.648.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313891 (program): Coordination sequence Gal.4.142.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313892 (program): Coordination sequence Gal.5.309.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313893 (program): Coordination sequence Gal.5.310.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313894 (program): Coordination sequence Gal.5.133.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313898 (program): Coordination sequence Gal.5.291.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313899 (program): Coordination sequence Gal.6.620.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313900 (program): Coordination sequence Gal.6.621.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313905 (program): Coordination sequence Gal.6.352.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313906 (program): Coordination sequence Gal.5.308.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313907 (program): Coordination sequence Gal.5.315.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313908 (program): Coordination sequence Gal.6.639.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313909 (program): Coordination sequence Gal.6.648.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313912 (program): Coordination sequence Gal.6.207.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313913 (program): Coordination sequence Gal.6.331.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313915 (program): Coordination sequence Gal.6.647.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313916 (program): Coordination sequence Gal.5.293.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313918 (program): Coordination sequence Gal.6.332.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313922 (program): Coordination sequence Gal.6.356.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313923 (program): Coordination sequence Gal.4.139.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313924 (program): Coordination sequence Gal.6.626.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313926 (program): Coordination sequence Gal.4.140.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313927 (program): Coordination sequence Gal.5.135.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313928 (program): Coordination sequence Gal.5.302.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313929 (program): Coordination sequence Gal.6.334.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313930 (program): Coordination sequence Gal.6.638.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313937 (program): Coordination sequence Gal.6.650.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313938 (program): Coordination sequence Gal.6.662.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313952 (program): Coordination sequence Gal.4.143.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313954 (program): Coordination sequence Gal.3.55.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313955 (program): Coordination sequence Gal.4.144.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313959 (program): Coordination sequence Gal.5.311.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313962 (program): Coordination sequence Gal.3.53.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313967 (program): Coordination sequence Gal.5.315.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313975 (program): Coordination sequence Gal.4.145.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313978 (program): Coordination sequence Gal.6.653.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313979 (program): Coordination sequence Gal.6.654.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A313982 (program): Coordination sequence Gal.3.57.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314015 (program): Coordination sequence Gal.4.100.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314019 (program): Coordination sequence Gal.6.152.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314020 (program): Coordination sequence Gal.6.247.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314021 (program): Coordination sequence Gal.5.84.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314022 (program): Coordination sequence Gal.6.203.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314024 (program): Coordination sequence Gal.6.156.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314025 (program): Coordination sequence Gal.6.250.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314026 (program): Coordination sequence Gal.5.130.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314027 (program): Coordination sequence Gal.5.87.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314028 (program): Coordination sequence Gal.6.198.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314029 (program): Coordination sequence Gal.6.328.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314031 (program): Coordination sequence Gal.6.340.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314032 (program): Coordination sequence Gal.6.324.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314034 (program): Coordination sequence Gal.5.132.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314038 (program): Coordination sequence Gal.6.616.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314039 (program): Coordination sequence Gal.5.299.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314040 (program): Coordination sequence Gal.4.133.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314043 (program): Coordination sequence Gal.6.618.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314044 (program): Coordination sequence Gal.6.649.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314048 (program): Coordination sequence Gal.6.618.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314049 (program): Coordination sequence Gal.3.51.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314051 (program): Coordination sequence Gal.5.308.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314052 (program): Coordination sequence Gal.6.639.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314053 (program): Coordination sequence Gal.5.311.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314054 (program): Coordination sequence Gal.4.142.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314056 (program): Coordination sequence Gal.4.135.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314057 (program): Coordination sequence Gal.6.635.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314059 (program): Coordination sequence Gal.6.652.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314060 (program): Coordination sequence Gal.6.636.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314061 (program): Coordination sequence Gal.6.647.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314065 (program): Coordination sequence Gal.4.143.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314066 (program): Coordination sequence Gal.4.144.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314067 (program): Coordination sequence Gal.3.53.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314068 (program): Coordination sequence Gal.3.55.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314069 (program): Coordination sequence Gal.6.652.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314071 (program): Coordination sequence Gal.5.311.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314075 (program): Coordination sequence Gal.5.315.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314085 (program): Coordination sequence Gal.6.132.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314086 (program): Coordination sequence Gal.6.232.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314087 (program): Coordination sequence Gal.5.67.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314088 (program): Coordination sequence Gal.5.111.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314089 (program): Coordination sequence Gal.6.260.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314090 (program): Coordination sequence Gal.4.54.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314091 (program): Coordination sequence Gal.6.153.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314092 (program): Coordination sequence Gal.6.248.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314093 (program): Coordination sequence Gal.5.137.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314094 (program): Coordination sequence Gal.6.345.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314095 (program): Coordination sequence Gal.6.204.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314096 (program): Coordination sequence Gal.4.73.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314097 (program): Coordination sequence Gal.6.354.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314098 (program): Coordination sequence Gal.6.339.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314099 (program): Coordination sequence Gal.5.131.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314100 (program): Coordination sequence Gal.6.329.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314106 (program): Coordination sequence Gal.6.199.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314107 (program): Coordination sequence Gal.6.205.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314108 (program): Coordination sequence Gal.6.198.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314109 (program): Coordination sequence Gal.6.204.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314110 (program): Coordination sequence Gal.6.200.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314111 (program): Coordination sequence Gal.5.289.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314112 (program): Coordination sequence Gal.4.134.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314117 (program): Coordination sequence Gal.6.330.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314118 (program): Coordination sequence Gal.6.652.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314120 (program): Coordination sequence Gal.3.55.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314121 (program): Coordination sequence Gal.6.657.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314122 (program): Coordination sequence Gal.5.311.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314124 (program): Coordination sequence Gal.6.619.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314126 (program): Coordination sequence Gal.5.315.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314127 (program): Coordination sequence Gal.6.326.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314128 (program): Coordination sequence Gal.5.315.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314129 (program): Coordination sequence Gal.5.312.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314133 (program): Coordination sequence Gal.6.623.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314134 (program): Coordination sequence Gal.6.624.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314135 (program): Coordination sequence Gal.6.489.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314140 (program): Coordination sequence Gal.6.633.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314141 (program): Coordination sequence Gal.5.290.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314142 (program): Coordination sequence Gal.6.636.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314144 (program): Coordination sequence Gal.6.634.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314145 (program): Coordination sequence Gal.4.145.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314148 (program): Coordination sequence Gal.4.139.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314149 (program): Coordination sequence Gal.6.620.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314151 (program): Coordination sequence Gal.6.621.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314156 (program): Coordination sequence Gal.6.651.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314157 (program): Coordination sequence Gal.6.623.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314159 (program): Coordination sequence Gal.6.624.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314160 (program): Coordination sequence Gal.6.650.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314161 (program): Coordination sequence Gal.4.140.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314163 (program): Coordination sequence Gal.5.301.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314164 (program): Coordination sequence Gal.5.302.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314165 (program): Coordination sequence Gal.5.307.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314167 (program): Coordination sequence Gal.6.638.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314185 (program): Coordination sequence Gal.6.205.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314186 (program): Coordination sequence Gal.6.330.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314188 (program): Coordination sequence Gal.4.145.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314189 (program): Coordination sequence Gal.6.636.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314191 (program): Coordination sequence Gal.5.292.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314192 (program): Coordination sequence Gal.6.651.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314193 (program): Coordination sequence Gal.4.141.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314194 (program): Coordination sequence Gal.6.625.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314201 (program): Coordination sequence Gal.6.157.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314202 (program): Coordination sequence Gal.6.251.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314203 (program): Coordination sequence Gal.5.88.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314204 (program): Coordination sequence Gal.6.341.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314205 (program): Coordination sequence Gal.5.133.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314208 (program): Coordination sequence Gal.6.619.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314209 (program): Coordination sequence Gal.5.293.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314210 (program): Coordination sequence Gal.6.623.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314211 (program): Coordination sequence Gal.6.650.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314216 (program): Coordination sequence Gal.6.624.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314218 (program): Coordination sequence Gal.5.304.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314220 (program): Coordination sequence Gal.5.306.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314221 (program): Coordination sequence Gal.6.641.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314222 (program): Coordination sequence Gal.6.643.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314225 (program): Coordination sequence Gal.5.316.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314231 (program): Coordination sequence Gal.5.305.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314233 (program): Coordination sequence Gal.6.208.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314234 (program): Coordination sequence Gal.6.332.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314236 (program): Coordination sequence Gal.6.626.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314239 (program): Coordination sequence Gal.6.642.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314240 (program): Coordination sequence Gal.6.643.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314244 (program): Coordination sequence Gal.6.644.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314247 (program): Coordination sequence Gal.3.50.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314249 (program): Coordination sequence Gal.4.136.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314250 (program): Coordination sequence Gal.4.137.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314251 (program): Coordination sequence Gal.5.294.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314252 (program): Coordination sequence Gal.5.295.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314253 (program): Coordination sequence Gal.6.627.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314254 (program): Coordination sequence Gal.6.628.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314263 (program): Coordination sequence Gal.6.662.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314264 (program): Coordination sequence Gal.5.316.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314283 (program): Coordination sequence Gal.5.318.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314347 (program): Coordination sequence Gal.4.85.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314364 (program): Coordination sequence Gal.5.91.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314458 (program): Coordination sequence Gal.3.40.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314548 (program): Coordination sequence Gal.4.99.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314668 (program): Coordination sequence Gal.6.115.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314669 (program): Coordination sequence Gal.6.216.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314670 (program): Coordination sequence Gal.5.50.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314671 (program): Coordination sequence Gal.5.95.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314672 (program): Coordination sequence Gal.4.38.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314674 (program): Coordination sequence Gal.4.58.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314677 (program): Coordination sequence Gal.3.10.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314680 (program): Coordination sequence Gal.6.149.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314683 (program): Coordination sequence Gal.6.130.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314684 (program): Coordination sequence Gal.6.149.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314685 (program): Coordination sequence Gal.3.16.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314688 (program): Coordination sequence Gal.6.254.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314689 (program): Coordination sequence Gal.6.255.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314691 (program): Coordination sequence Gal.6.256.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314692 (program): Coordination sequence Gal.5.81.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314706 (program): Coordination sequence Gal.6.130.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314707 (program): Coordination sequence Gal.6.129.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314708 (program): Coordination sequence Gal.5.65.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314710 (program): Coordination sequence Gal.5.64.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314712 (program): Coordination sequence Gal.6.150.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314720 (program): Coordination sequence Gal.6.245.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314725 (program): Coordination sequence Gal.5.114.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314726 (program): Coordination sequence Gal.6.259.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314736 (program): Coordination sequence Gal.5.115.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314737 (program): Coordination sequence Gal.6.260.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314740 (program): Coordination sequence Gal.5.116.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314741 (program): Coordination sequence Gal.6.261.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314742 (program): Coordination sequence Gal.6.262.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314752 (program): Coordination sequence Gal.6.258.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314753 (program): Coordination sequence Gal.4.52.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314754 (program): Coordination sequence Gal.5.82.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314758 (program): Coordination sequence Gal.6.193.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314765 (program): Coordination sequence Gal.6.194.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314770 (program): Coordination sequence Gal.6.195.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314776 (program): Coordination sequence Gal.6.478.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314825 (program): Coordination sequence Gal.6.118.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314826 (program): Coordination sequence Gal.6.129.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314827 (program): Coordination sequence Gal.5.53.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314828 (program): Coordination sequence Gal.5.64.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314829 (program): Coordination sequence Gal.4.41.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314830 (program): Coordination sequence Gal.6.150.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314832 (program): Coordination sequence Gal.6.245.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314836 (program): Coordination sequence Gal.6.131.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314837 (program): Coordination sequence Gal.6.231.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314838 (program): Coordination sequence Gal.4.52.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314840 (program): Coordination sequence Gal.5.66.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314841 (program): Coordination sequence Gal.6.151.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314847 (program): Coordination sequence Gal.6.193.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314848 (program): Coordination sequence Gal.5.110.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314849 (program): Coordination sequence Gal.6.246.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314874 (program): Coordination sequence Gal.3.33.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314884 (program): Coordination sequence Gal.6.150.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314885 (program): Coordination sequence Gal.6.245.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314886 (program): Coordination sequence Gal.5.114.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314887 (program): Coordination sequence Gal.6.318.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314890 (program): Coordination sequence Gal.6.152.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314893 (program): Coordination sequence Gal.6.259.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314894 (program): Coordination sequence Gal.6.194.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314896 (program): Coordination sequence Gal.4.53.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314898 (program): Coordination sequence Gal.5.136.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314899 (program): Coordination sequence Gal.6.153.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314902 (program): Coordination sequence Gal.6.322.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314903 (program): Coordination sequence Gal.6.339.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314912 (program): Coordination sequence Gal.6.195.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314915 (program): Coordination sequence Gal.6.248.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314922 (program): Coordination sequence Gal.6.474.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314941 (program): Coordination sequence Gal.3.41.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314943 (program): Coordination sequence Gal.6.321.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314945 (program): Coordination sequence Gal.5.84.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314947 (program): Coordination sequence Gal.6.198.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314953 (program): Coordination sequence Gal.6.202.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314954 (program): Coordination sequence Gal.4.77.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314955 (program): Coordination sequence Gal.6.322.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314959 (program): Coordination sequence Gal.6.340.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314961 (program): Coordination sequence Gal.5.137.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314963 (program): Coordination sequence Gal.6.199.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314964 (program): Coordination sequence Gal.6.200.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314969 (program): Coordination sequence Gal.4.78.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314970 (program): Coordination sequence Gal.6.341.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314971 (program): Coordination sequence Gal.5.138.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314972 (program): Coordination sequence Gal.5.139.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314973 (program): Coordination sequence Gal.6.342.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A314974 (program): Coordination sequence Gal.6.343.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315018 (program): Coordination sequence Gal.6.193.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315019 (program): Coordination sequence Gal.6.320.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315020 (program): Coordination sequence Gal.4.76.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315024 (program): Coordination sequence Gal.6.196.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315026 (program): Coordination sequence Gal.6.337.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315030 (program): Coordination sequence Gal.6.344.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315032 (program): Coordination sequence Gal.4.72.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315033 (program): Coordination sequence Gal.5.129.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315034 (program): Coordination sequence Gal.6.323.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315036 (program): Coordination sequence Gal.4.122.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315050 (program): Coordination sequence Gal.5.140.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315052 (program): Coordination sequence Gal.6.338.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315053 (program): Coordination sequence Gal.6.345.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315056 (program): Coordination sequence Gal.6.348.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315057 (program): Coordination sequence Gal.4.57.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315058 (program): Coordination sequence Gal.6.339.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315060 (program): Coordination sequence Gal.5.141.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315061 (program): Coordination sequence Gal.5.130.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315062 (program): Coordination sequence Gal.6.324.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315064 (program): Coordination sequence Gal.6.347.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315067 (program): Coordination sequence Gal.6.349.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315068 (program): Coordination sequence Gal.5.131.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315069 (program): Coordination sequence Gal.6.325.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315070 (program): Coordination sequence Gal.6.326.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315075 (program): Coordination sequence Gal.6.350.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315170 (program): Coordination sequence Gal.6.119.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315171 (program): Coordination sequence Gal.6.220.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315172 (program): Coordination sequence Gal.5.54.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315173 (program): Coordination sequence Gal.5.99.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315175 (program): Coordination sequence Gal.4.42.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315177 (program): Coordination sequence Gal.6.255.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315178 (program): Coordination sequence Gal.4.62.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315182 (program): Coordination sequence Gal.6.155.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315183 (program): Coordination sequence Gal.6.201.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315185 (program): Coordination sequence Gal.5.115.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315186 (program): Coordination sequence Gal.6.263.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315187 (program): Coordination sequence Gal.3.14.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315188 (program): Coordination sequence Gal.6.265.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315191 (program): Coordination sequence Gal.5.186.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315194 (program): Coordination sequence Gal.6.154.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315195 (program): Coordination sequence Gal.6.249.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315196 (program): Coordination sequence Gal.6.202.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315198 (program): Coordination sequence Gal.5.86.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315202 (program): Coordination sequence Gal.6.194.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315203 (program): Coordination sequence Gal.6.321.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315204 (program): Coordination sequence Gal.4.77.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315207 (program): Coordination sequence Gal.5.140.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315208 (program): Coordination sequence Gal.6.348.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315210 (program): Coordination sequence Gal.6.327.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315211 (program): Coordination sequence Gal.3.20.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315212 (program): Coordination sequence Gal.6.351.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315214 (program): Coordination sequence Gal.5.142.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315215 (program): Coordination sequence Gal.6.352.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315216 (program): Coordination sequence Gal.6.353.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315237 (program): Coordination sequence Gal.4.128.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315244 (program): Coordination sequence Gal.6.156.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315245 (program): Coordination sequence Gal.6.250.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315246 (program): Coordination sequence Gal.6.203.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315247 (program): Coordination sequence Gal.5.87.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315253 (program): Coordination sequence Gal.6.132.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315254 (program): Coordination sequence Gal.6.232.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315255 (program): Coordination sequence Gal.5.67.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315256 (program): Coordination sequence Gal.5.111.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315257 (program): Coordination sequence Gal.4.100.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315258 (program): Coordination sequence Gal.6.260.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315259 (program): Coordination sequence Gal.4.54.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315260 (program): Coordination sequence Gal.6.340.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315261 (program): Coordination sequence Gal.6.204.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315264 (program): Coordination sequence Gal.6.328.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315265 (program): Coordination sequence Gal.5.132.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315266 (program): Coordination sequence Gal.6.205.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315267 (program): Coordination sequence Gal.6.215.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315270 (program): Coordination sequence Gal.5.137.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315271 (program): Coordination sequence Gal.6.345.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315272 (program): Coordination sequence Gal.6.351.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315273 (program): Coordination sequence Gal.4.73.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315274 (program): Coordination sequence Gal.6.354.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315275 (program): Coordination sequence Gal.6.329.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315277 (program): Coordination sequence Gal.6.330.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315302 (program): Coordination sequence Gal.6.152.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315303 (program): Coordination sequence Gal.6.247.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315304 (program): Coordination sequence Gal.5.84.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315305 (program): Coordination sequence Gal.6.338.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315306 (program): Coordination sequence Gal.5.130.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315307 (program): Coordination sequence Gal.6.616.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315308 (program): Coordination sequence Gal.5.299.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315309 (program): Coordination sequence Gal.4.133.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315310 (program): Coordination sequence Gal.6.618.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315311 (program): Coordination sequence Gal.3.51.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315312 (program): Coordination sequence Gal.6.639.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315315 (program): Coordination sequence Gal.6.198.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315316 (program): Coordination sequence Gal.6.324.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315318 (program): Coordination sequence Gal.6.622.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315319 (program): Coordination sequence Gal.5.289.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315320 (program): Coordination sequence Gal.4.135.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315321 (program): Coordination sequence Gal.6.635.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315322 (program): Coordination sequence Gal.6.636.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315326 (program): Coordination sequence Gal.6.204.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315327 (program): Coordination sequence Gal.6.329.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315329 (program): Coordination sequence Gal.6.635.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315333 (program): Coordination sequence Gal.5.292.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315334 (program): Coordination sequence Gal.6.623.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315335 (program): Coordination sequence Gal.6.624.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315337 (program): Coordination sequence Gal.4.145.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315339 (program): Coordination sequence Gal.4.141.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315340 (program): Coordination sequence Gal.6.625.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315342 (program): Coordination sequence Gal.5.303.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315343 (program): Coordination sequence Gal.5.304.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315344 (program): Coordination sequence Gal.6.640.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315345 (program): Coordination sequence Gal.6.641.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315351 (program): Coordination sequence Gal.6.650.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315361 (program): Coordination sequence Gal.5.328.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315395 (program): Coordination sequence Gal.6.120.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315396 (program): Coordination sequence Gal.6.221.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315397 (program): Coordination sequence Gal.5.55.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315398 (program): Coordination sequence Gal.5.100.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315399 (program): Coordination sequence Gal.4.43.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315400 (program): Coordination sequence Gal.6.256.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315401 (program): Coordination sequence Gal.4.63.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315402 (program): Coordination sequence Gal.5.116.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315403 (program): Coordination sequence Gal.6.264.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315404 (program): Coordination sequence Gal.6.265.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315405 (program): Coordination sequence Gal.3.15.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315406 (program): Coordination sequence Gal.6.206.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315409 (program): Coordination sequence Gal.6.195.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315410 (program): Coordination sequence Gal.6.322.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315411 (program): Coordination sequence Gal.4.78.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315412 (program): Coordination sequence Gal.5.141.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315413 (program): Coordination sequence Gal.6.157.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315414 (program): Coordination sequence Gal.6.206.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315415 (program): Coordination sequence Gal.6.207.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315416 (program): Coordination sequence Gal.5.142.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315417 (program): Coordination sequence Gal.6.354.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315418 (program): Coordination sequence Gal.3.21.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315420 (program): Coordination sequence Gal.6.355.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315421 (program): Coordination sequence Gal.6.356.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315423 (program): Coordination sequence Gal.5.208.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315425 (program): Coordination sequence Gal.6.341.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315426 (program): Coordination sequence Gal.6.331.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315427 (program): Coordination sequence Gal.5.133.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315432 (program): Coordination sequence Gal.6.650.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315444 (program): Coordination sequence Gal.6.133.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315445 (program): Coordination sequence Gal.6.233.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315447 (program): Coordination sequence Gal.5.112.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315450 (program): Coordination sequence Gal.6.261.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315452 (program): Coordination sequence Gal.4.55.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315453 (program): Coordination sequence Gal.6.207.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315454 (program): Coordination sequence Gal.6.331.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315455 (program): Coordination sequence Gal.6.208.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315459 (program): Coordination sequence Gal.6.134.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315460 (program): Coordination sequence Gal.6.234.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315461 (program): Coordination sequence Gal.5.69.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315462 (program): Coordination sequence Gal.6.339.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315463 (program): Coordination sequence Gal.5.113.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315464 (program): Coordination sequence Gal.6.346.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315465 (program): Coordination sequence Gal.6.157.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315466 (program): Coordination sequence Gal.6.158.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315467 (program): Coordination sequence Gal.6.159.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315468 (program): Coordination sequence Gal.5.300.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315469 (program): Coordination sequence Gal.4.134.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315470 (program): Coordination sequence Gal.6.253.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315471 (program): Coordination sequence Gal.3.52.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315474 (program): Coordination sequence Gal.6.341.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315475 (program): Coordination sequence Gal.5.133.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315476 (program): Coordination sequence Gal.6.619.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315477 (program): Coordination sequence Gal.5.293.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315478 (program): Coordination sequence Gal.6.209.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315479 (program): Coordination sequence Gal.6.210.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315481 (program): Coordination sequence Gal.5.139.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315482 (program): Coordination sequence Gal.6.347.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315485 (program): Coordination sequence Gal.6.205.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315486 (program): Coordination sequence Gal.6.330.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315488 (program): Coordination sequence Gal.6.343.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315489 (program): Coordination sequence Gal.5.292.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315490 (program): Coordination sequence Gal.4.141.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315491 (program): Coordination sequence Gal.6.625.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315492 (program): Coordination sequence Gal.6.625.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315495 (program): Coordination sequence Gal.5.135.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315496 (program): Coordination sequence Gal.5.306.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315498 (program): Coordination sequence Gal.6.334.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315499 (program): Coordination sequence Gal.6.643.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315505 (program): Coordination sequence Gal.3.59.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315507 (program): Coordination sequence Gal.6.199.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315508 (program): Coordination sequence Gal.6.325.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315509 (program): Coordination sequence Gal.6.633.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315510 (program): Coordination sequence Gal.5.290.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315511 (program): Coordination sequence Gal.4.139.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315512 (program): Coordination sequence Gal.6.626.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315515 (program): Coordination sequence Gal.6.200.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315516 (program): Coordination sequence Gal.6.326.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315517 (program): Coordination sequence Gal.6.208.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315518 (program): Coordination sequence Gal.5.291.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315519 (program): Coordination sequence Gal.6.332.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315520 (program): Coordination sequence Gal.4.140.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315521 (program): Coordination sequence Gal.6.620.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315522 (program): Coordination sequence Gal.6.621.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315523 (program): Coordination sequence Gal.5.301.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315525 (program): Coordination sequence Gal.3.49.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315526 (program): Coordination sequence Gal.6.637.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315527 (program): Coordination sequence Gal.6.638.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315530 (program): Coordination sequence Gal.4.148.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315534 (program): Coordination sequence Gal.6.624.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315535 (program): Coordination sequence Gal.5.304.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315536 (program): Coordination sequence Gal.5.306.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315537 (program): Coordination sequence Gal.6.641.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315538 (program): Coordination sequence Gal.3.50.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315539 (program): Coordination sequence Gal.6.642.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315540 (program): Coordination sequence Gal.6.643.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315541 (program): Coordination sequence Gal.4.136.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315543 (program): Coordination sequence Gal.4.137.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315546 (program): Coordination sequence Gal.5.294.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315547 (program): Coordination sequence Gal.5.295.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315548 (program): Coordination sequence Gal.6.627.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315549 (program): Coordination sequence Gal.6.628.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315563 (program): Coordination sequence Gal.5.320.2 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315610 (program): Coordination sequence Gal.5.256.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315614 (program): Coordination sequence Gal.5.318.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315629 (program): Coordination sequence Gal.6.133.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315630 (program): Coordination sequence Gal.6.233.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315631 (program): Coordination sequence Gal.5.68.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315632 (program): Coordination sequence Gal.5.112.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315633 (program): Coordination sequence Gal.6.261.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315634 (program): Coordination sequence Gal.4.55.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315635 (program): Coordination sequence Gal.5.138.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315636 (program): Coordination sequence Gal.6.346.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315637 (program): Coordination sequence Gal.6.352.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315638 (program): Coordination sequence Gal.6.355.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315639 (program): Coordination sequence Gal.4.74.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315641 (program): Coordination sequence Gal.6.208.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315642 (program): Coordination sequence Gal.6.332.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315643 (program): Coordination sequence Gal.6.199.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315644 (program): Coordination sequence Gal.6.325.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315645 (program): Coordination sequence Gal.6.633.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315646 (program): Coordination sequence Gal.5.290.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315647 (program): Coordination sequence Gal.4.139.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315649 (program): Coordination sequence Gal.6.626.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315650 (program): Coordination sequence Gal.6.623.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315651 (program): Coordination sequence Gal.5.303.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315653 (program): Coordination sequence Gal.5.305.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315654 (program): Coordination sequence Gal.3.49.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315655 (program): Coordination sequence Gal.6.644.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315666 (program): Coordination sequence Gal.6.134.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315667 (program): Coordination sequence Gal.6.234.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315668 (program): Coordination sequence Gal.5.69.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315669 (program): Coordination sequence Gal.5.113.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315670 (program): Coordination sequence Gal.6.262.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315671 (program): Coordination sequence Gal.4.56.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315672 (program): Coordination sequence Gal.5.139.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315673 (program): Coordination sequence Gal.6.347.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315674 (program): Coordination sequence Gal.6.353.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315675 (program): Coordination sequence Gal.6.356.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315676 (program): Coordination sequence Gal.4.75.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315678 (program): Coordination sequence Gal.6.158.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315679 (program): Coordination sequence Gal.6.252.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315680 (program): Coordination sequence Gal.5.89.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315681 (program): Coordination sequence Gal.6.159.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315682 (program): Coordination sequence Gal.6.253.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315683 (program): Coordination sequence Gal.6.634.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315684 (program): Coordination sequence Gal.5.291.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315685 (program): Coordination sequence Gal.4.140.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315686 (program): Coordination sequence Gal.6.209.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315687 (program): Coordination sequence Gal.6.210.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315688 (program): Coordination sequence Gal.6.343.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315689 (program): Coordination sequence Gal.6.624.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315690 (program): Coordination sequence Gal.5.135.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315691 (program): Coordination sequence Gal.5.306.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315692 (program): Coordination sequence Gal.6.334.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315693 (program): Coordination sequence Gal.3.50.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315695 (program): Coordination sequence Gal.6.620.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315696 (program): Coordination sequence Gal.5.301.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315697 (program): Coordination sequence Gal.6.621.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315698 (program): Coordination sequence Gal.5.302.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315699 (program): Coordination sequence Gal.6.637.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315700 (program): Coordination sequence Gal.6.638.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315701 (program): Coordination sequence Gal.4.136.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315702 (program): Coordination sequence Gal.6.641.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315703 (program): Coordination sequence Gal.6.643.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315704 (program): Coordination sequence Gal.4.137.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315706 (program): Coordination sequence Gal.5.294.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315707 (program): Coordination sequence Gal.5.295.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315709 (program): Coordination sequence Gal.6.627.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315710 (program): Coordination sequence Gal.6.628.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315725 (program): Coordination sequence Gal.6.158.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315726 (program): Coordination sequence Gal.6.252.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315727 (program): Coordination sequence Gal.5.89.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315728 (program): Coordination sequence Gal.6.342.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315729 (program): Coordination sequence Gal.5.134.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315730 (program): Coordination sequence Gal.6.620.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315731 (program): Coordination sequence Gal.5.301.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315732 (program): Coordination sequence Gal.6.640.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315733 (program): Coordination sequence Gal.6.642.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315734 (program): Coordination sequence Gal.4.136.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315735 (program): Coordination sequence Gal.6.159.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315736 (program): Coordination sequence Gal.6.253.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315737 (program): Coordination sequence Gal.5.90.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315738 (program): Coordination sequence Gal.6.343.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315739 (program): Coordination sequence Gal.5.135.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315740 (program): Coordination sequence Gal.6.209.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315741 (program): Coordination sequence Gal.6.210.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315742 (program): Coordination sequence Gal.5.302.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315743 (program): Coordination sequence Gal.6.334.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315744 (program): Coordination sequence Gal.6.643.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315745 (program): Coordination sequence Gal.4.137.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315746 (program): Coordination sequence Gal.6.637.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315747 (program): Coordination sequence Gal.6.638.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315748 (program): Coordination sequence Gal.5.294.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315749 (program): Coordination sequence Gal.5.295.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315750 (program): Coordination sequence Gal.6.627.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315751 (program): Coordination sequence Gal.6.628.4 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315753 (program): Coordination sequence Gal.5.316.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315754 (program): Coordination sequence Gal.6.209.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315755 (program): Coordination sequence Gal.6.333.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315756 (program): Coordination sequence Gal.6.637.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315757 (program): Coordination sequence Gal.5.294.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315758 (program): Coordination sequence Gal.6.210.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315759 (program): Coordination sequence Gal.6.334.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315760 (program): Coordination sequence Gal.6.638.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315761 (program): Coordination sequence Gal.5.295.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315762 (program): Coordination sequence Gal.6.627.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315763 (program): Coordination sequence Gal.6.628.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315767 (program): Coordination sequence Gal.6.627.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315768 (program): Coordination sequence Gal.6.628.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315769 (program): Coordination sequence Gal.6.370.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315847 (program): Coordination sequence Gal.5.232.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315886 (program): Coordination sequence Gal.6.527.6 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315889 (program): Coordination sequence Gal.5.253.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315907 (program): Coordination sequence Gal.3.40.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315943 (program): Coordination sequence Gal.5.229.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A315972 (program): Coordination sequence Gal.3.41.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A316026 (program): Coordination sequence Gal.3.36.3 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A316047 (program): Coordination sequence Gal.6.374.5 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
  • A316087 (program): Expansion of 1/(1 + Sum_{k>=1} k^2 * x^k).
  • A316088 (program): Expansion of 1/(1 + Sum_{k>=1} k^3 * x^k).
  • A316091 (program): Heinz numbers of integer partitions of prime numbers.
  • A316100 (program): Numbers k such that k is deficient but k+1 is abundant, that is, a deficient number followed by an abundant number.
  • A316131 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+3) = 1, negated.
  • A316132 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+3) = 1, negated.
  • A316133 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+3) = 1.
  • A316134 (program): Decimal expansion of the least x such that 1/x + 1/(x+2) + 1/(x+3) = 1 (negated).
  • A316135 (program): Decimal expansion of the middle x such that 1/x + 1/(x+2) + 1/(x+3) = 1 (negated).
  • A316136 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+3) = 1.
  • A316137 (program): Decimal expansion of the least x such that 1/x + 1/(x+2) + 1/(x+4) = 1.
  • A316138 (program): Decimal expansion of the middle x such that 1/x + 1/(x+2) + 1/(x+4) = 1.
  • A316139 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+4) = 1.
  • A316140 (program): Denominator of the autosequence 2/((n+2)*(n+3)) difference table written by antidiagonals.
  • A316148 (program): Number of non-congruent solutions of x^2+y^2 == z^2+w^2 (mod n).
  • A316160 (program): Number of pairs of compositions of n corresponding to a seaweed algebra of index n-3.
  • A316161 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+2) = 2.
  • A316162 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+2) = 2.
  • A316163 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+2) = 2.
  • A316164 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+3) = 2.
  • A316165 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+3) = 2.
  • A316166 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+3) = 2.
  • A316167 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+4) = 2.
  • A316168 (program): Decimal expansion of the middle x such that 1/x + 1/(x+2) + 1/(x+4) = 2, negated.
  • A316169 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+4) = 2, negated.
  • A316193 (program): Number of symmetric self-avoiding polygons on honeycomb net with perimeter 2*n, not counting rotations and reflections as distinct.
  • A316224 (program): a(n) = n*(2*n + 1)*(4*n + 1).
  • A316246 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+2) = 3.
  • A316247 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+2) = 3.
  • A316248 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+2) = 3.
  • A316249 (program): Decimal expansion of the least x such that 1/x + 1/(x+1) + 1/(x+3) = 3.
  • A316250 (program): Decimal expansion of the middle x such that 1/x + 1/(x+1) + 1/(x+3) = 3.
  • A316251 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+1) + 1/(x+3) = 3.
  • A316252 (program): Decimal expansion of the least x such that 1/x + 1/(x+2) + 1/(x+3) = 3.
  • A316253 (program): Decimal expansion of the middle x such that 1/x + 1/(x+2) + 1/(x+3) = 3.
  • A316254 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+3) = 3.
  • A316255 (program): Decimal expansion of the least x such that 1/x + 1/(x+2) + 1/(x+4) = 3.
  • A316256 (program): Decimal expansion of the middle x such that 1/x + 1/(x+2) + 1/(x+4) = 3.
  • A316257 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+2) + 1/(x+4) = 3.
  • A316258 (program): Decimal expansion of the least x such that 1/x + 1/(x+3) + 1/(x+4) = 3 (negated).
  • A316259 (program): Decimal expansion of the middle x such that 1/x + 1/(x+3) + 1/(x+4) = 3 (negated).
  • A316260 (program): Decimal expansion of the greatest x such that 1/x + 1/(x+3) + 1/(x+4) = 3.
  • A316261 (program): The number of ways to induce a single pinch on a compact 2-manifold with n handles. (Note: The manifold is embedded in Euclidean 2-space, and each pinch partitions it into at most two submanifolds.)
  • A316262 (program): Numbers k such that gcd(k, floor(phi*k)) > 1, where phi is the golden ratio.
  • A316269 (program): Array T(n,k) = n*T(n,k-1) - T(n,k-2) read by upward antidiagonals, with T(n,0) = 0, T(n,1) = 1, n >= 2.
  • A316270 (program): Number of tricolorable prime knots with n minimal crossings.
  • A316275 (program): Lucas analog to A101361.
  • A316296 (program): a(n) = Sum_{k=1..n} f(k, n), where f(i, j) is the number of multiples of i greater than j and less than 2*j.
  • A316297 (program): a(n) = n! times the denominator of the n-th harmonic number H(n).
  • A316316 (program): Coordination sequence for tetravalent node in chamfered version of square grid.
  • A316317 (program): Coordination sequence for trivalent node in chamfered version of square grid.
  • A316319 (program): Coordination sequence for a trivalent node in a chamfered version of the 3^6 triangular tiling of the plane.
  • A316320 (program): Coordination sequence for a hexavalent node in a chamfered version of the 3^6 triangular tiling of the plane.
  • A316322 (program): Sum of piles of first n primes: a(n) = Sum(prime(i)*(2*i-1): 1<=i<=n).
  • A316324 (program): Indices of 1’s in A305389.
  • A316325 (program): Indices of 2’s in A305389.
  • A316326 (program): Indices of 3’s in A305389.
  • A316327 (program): First differences of indices of 1’s in A305389.
  • A316330 (program): a(n) = A000085(4*n)/2^n.
  • A316331 (program): a(n) = A000085(4*n+1)/2^n.
  • A316332 (program): a(n) = A000085(4*n+2)/2^(n+1).
  • A316333 (program): a(n) = A000085(4*n+3)/2^(n+2).
  • A316340 (program): Image of 1 under repeated application of the morphism 1 -> 12312, 2 -> 341, 3 -> 34134, 4 -> 123,
  • A316341 (program): Characteristic function of the factorials 1!, 2!, 3!, …
  • A316342 (program): Fibonacci word A003849 with first two terms replaced by 2’s.
  • A316344 (program): An example of a word that is uniform morphic, but neither pure morphic, primitive morphic, nor recurrent.
  • A316345 (program): An example of a word that is uniform morphic and recurrent, but neither pure morphic nor primitive morphic.
  • A316346 (program): a(n) = A316297(n+1)/A316297(n).
  • A316347 (program): a(n) = n^2 mod(10^m), where m is the number of digits in n (written in base 10).
  • A316351 (program): Numbers k such that k^2 + 1 has exactly four distinct prime factors.
  • A316352 (program): Decimal expansion of (BesselI(0,1/2)-BesselI(1,1/2))/(BesselI(0,1/2)-3*BesselI(1,1/2)).
  • A316355 (program): 2k-1 appears 2k times after 2k-2 appears once.
  • A316357 (program): Partial sums of A316316.
  • A316358 (program): Partial sums of A316317.
  • A316359 (program): a(n) is the number of solutions to the Diophantine equation i^3 + j^3 + k^3 = n^3, where 0 < i <= j <= k.
  • A316363 (program): O.g.f. A(x) satisfies: Sum_{n>=1} (x + (-1)^n*A(x))^n / n = 0.
  • A316371 (program): G.f.: A(x) = Sum_{n>=0} binomial(3*(n+1), n)/(n+1) * x^n / (1+x)^(2*(n+1)).
  • A316384 (program): Number of ways to stack n triangles symmetrically in a valley (pointing upwards or downwards depending on row parity).
  • A316385 (program): Lexicographically earliest sequence of distinct positive terms such that for any n > 0, a(n) AND a(2*n) = a(n) (where AND denotes the binary AND operator).
  • A316386 (program): Binomial transform of [0, 1, 2, -3, -4, 5, 6, -7, -8, …].
  • A316457 (program): Expansion of x*(31 + 326*x + 336*x^2 + 26*x^3 + x^4) / (1 - x)^6.
  • A316458 (program): Expansion of 60*x*(1 + 4*x + x^2) / (1 - x)^5.
  • A316459 (program): Expansion of 30*x*(1 + x) / (1 - x)^4.
  • A316461 (program): Expansion of Product_{k>=1} 1/(1-x^k)^(9*k).
  • A316462 (program): Expansion of Product_{k>=1} 1/(1-x^k)^(10*k).
  • A316463 (program): Expansion of Product_{k>0} (1 - x^k)^(4*k).
  • A316464 (program): Expansion of Product_{k>0} (1 - x^k)^(5*k).
  • A316466 (program): a(n) = 2*n*(7*n - 3).
  • A316505 (program): a(n) is the smallest number k > 1 such that k^n - 1 is divisible by 3^n.
  • A316523 (program): Number of odd multiplicities minus number of even multiplicities in the canonical prime factorization of n.
  • A316524 (program): Signed sum over the prime indices of n.
  • A316528 (program): a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3) for n > 2, a(0)=1, a(1)=4, a(2)=10.
  • A316529 (program): Heinz numbers of totally strong integer partitions.
  • A316533 (program): a(n) is the Sprague-Grundy value of the Node-Kayles game played on the generalized Petersen graph P(n,2).
  • A316553 (program): Number of elements of order 2 in the group SL(2, Z(n)).
  • A316562 (program): Koechel number for the works of W. A. Mozart rounded from age 11.
  • A316568 (program): Largest k such that 1^2 + n, 2^2 + n, …, k^2 + n are composite.
  • A316569 (program): a(n) = Jacobi (or Kronecker) symbol (n, 15).
  • A316570 (program): Multiplicative digital root of sigma(n).
  • A316571 (program): a(1) = 1; for n > 1: a(n) = smallest number such that (Sum_{k=1..n} a(k)) is divisible by n - 1
  • A316592 (program): a(n) equals the coefficient of x^n in Sum_{m>=0} (x^m + 2 + 1/x^m)^m for n >= 1.
  • A316626 (program): a(1)=a(2)=a(3)=1; a(n) = a(n-2*a(n-1))+a(n-1-2*a(n-2)) for n > 3.
  • A316627 (program): a(1)=2, a(2)=3; a(n) = a(n+1-a(n-1))+a(n-a(n-2)) for n > 2.
  • A316628 (program): a(1)=1, a(2)=2, a(3)=2, a(4)=3; a(n) = a(n-a(n-1))+a(n-1-a(n-2)-a(n-2-a(n-2))) for n > 4.
  • A316631 (program): Expansion of A(x) = x*(1+3*x^2+x^3+3*x^4+x^6)/(1-x^4)^2.
  • A316649 (program): Triangle read by rows in which T(n,k) is the number of length k chains from (0,0) to (n,n) of the poset [n] X [n] ordered by the product order, 0 <= k <= 2n, n>=0.
  • A316660 (program): Number of n-bit binary necklaces (unmarked cyclic n-bit binary strings) containing no runs of length > 2.
  • A316661 (program): a(n) = ceiling(sqrt((2*n)^n)).
  • A316662 (program): Expansion of f(x, x^2) * psi(x^3)^3 in powers of x where psi() is a Ramanujan theta function and f(, ) is Ramanujan’s general theta function.
  • A316663 (program): Floor(sqrt((2*n)^(n+1)))
  • A316666 (program): Number of simple relaxed compacted binary trees of right height at most one with no sequences on level 1 and no final sequences on level 0.
  • A316669 (program): Squares visited by queen moves on a diagonally numbered board and moving to the lowest available unvisited square at each step.
  • A316670 (program): Squares visited by bishop moves on a diagonally numbered board and moving to the lowest available unvisited square at each step.
  • A316671 (program): Squares visited by moving diagonally one square on a diagonally numbered board and moving to the lowest available unvisited square at each step.
  • A316672 (program): Numbers k for which 120*k + 169 is a square.
  • A316673 (program): Number of paths from (0,0,0) to (n,n,n) that always move closer to (n,n,n).
  • A316688 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 6, 7 or 8 king-move adjacent elements, with upper left element zero.
  • A316708 (program): Bisection of the odd-indexed Pell numbers A001653: part 1.
  • A316709 (program): Bisection of the odd-indexed Pell numbers A001853: part 2.
  • A316711 (program): Decimal expansion of s:= t/(t - 1), with the tribonacci constant t = A058265.
  • A316714 (program): a(n) is the number of digits of A316713(n). This is the number of A, B and C sequences used in the tribonacci ABC-representation of n >= 0.
  • A316715 (program): a(n) is the number of 1s in A316713(n). That is, a(n) is the number of B-sequences (A278039) used in the tribonacci ABC-representation of n >= 0.
  • A316716 (program): a(n) is the number of 2s in A316713(n). That is, a(n) is the number of A-sequences (A278040) used in the tribonacci ABC-representation of n >= 0.
  • A316717 (program): a(n) is the number of 3s in A316713(n). That is, a(n) is the number of C-sequences (A278041) used in the tribonacci ABC-representation of n >= 0.
  • A316724 (program): Generalized 26-gonal (or icosihexagonal) numbers: m*(12*m - 11) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316725 (program): Generalized 27-gonal (or icosiheptagonal) numbers: m*(25*m - 23)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316726 (program): The number of ways to tile (with squares and rectangles) a 2 X (n+2) strip with the upper left and upper right squares removed.
  • A316729 (program): Generalized 30-gonal (or triacontagonal) numbers: m*(14*m - 13) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316742 (program): Stepping through the Mersenne sequence (A000225) one step back, two steps forward.
  • A316776 (program): a(n) is the number of integers 0 < k < n such that n^2 - k^2 is a semiprime.
  • A316777 (program): a(n) = Sum_{k=1..n} (k!)^5.
  • A316779 (program): Expansion of 1 + (1/(1-x) + 1/(1-3*x))*x/2 + (1/(1-x) - 8/(1-2*x) + 9/(1-3*x))*x^5/2.
  • A316793 (program): Numbers whose prime multiplicities are distinct and relatively prime.
  • A316823 (program): Balanced nonary enumeration (or balanced nonary representation) of integers; write n in nonary (base 9) and then replace 5’s with (-4)’s, 6’s with (-3)’s, 7’s with (-2)’s, and 8’s with (-1)’s.
  • A316824 (program): A second example of a word that is uniform morphic and recurrent, but neither pure morphic nor primitive morphic.
  • A316825 (program): Fibonacci word A003849 with its initial term changed to 2.
  • A316826 (program): Image of 3 under repeated application of the morphism 3 -> 3,2, 2 -> 1,0,2,0,1,2, 1 -> 1,0,1,2, 0 -> 0,2.
  • A316828 (program): Image of the Thue-Morse sequence A010060 under the morphism {1 -> 1,2; 0 -> 0,2}.
  • A316829 (program): Image of 0 under repeated application of the morphism 0 -> 0,1,0, 1 -> 1,1,1.
  • A316831 (program): Trajectory of 0 under repeated application of the morphism 0 -> 01, 1 -> 21, 2 -> 13, 3 -> 33.
  • A316832 (program): In A316831, replace 2’s and 3’s with 0’s.
  • A316843 (program): Column 1 of table A316841.
  • A316846 (program): Column 1 of table A316842.
  • A316862 (program): Expansion of 1/(Sum_{k>=0} (k!)^3 x^k).
  • A316863 (program): Number of times 2 appears in the decimal expansion of n.
  • A316864 (program): Number of times 3 appears in decimal expansion of n.
  • A316865 (program): Number of times 4 appears in decimal expansion of n.
  • A316866 (program): Number of times 5 appears in decimal expansion of n.
  • A316867 (program): Number of times 6 appears in decimal expansion of n.
  • A316868 (program): Number of times 7 appears in decimal expansion of n.
  • A316869 (program): Number of times 8 appears in decimal expansion of n.
  • A316886 (program): Where records occur in A299773.
  • A316936 (program): a(n) is the maximum state complexity of the language C(w) of conjugates of w, over all length-n binary strings w.
  • A316937 (program): a(n) = 3*a(n-1) - a(n-2) - 2*a(n-3) for n > 2, a(0)=3, a(1)=10, a(2)=26.
  • A316964 (program): Same as A316669, except numbering of the squares starts at 0 rather than 1..
  • A316965 (program): Same as A316670, except numbering of the squares starts at 0 rather than 1.
  • A316966 (program): Same as A316671, except numbering of the squares starts at 0 rather than 1.
  • A316987 (program): G.f.: A(x) = Sum_{n>=0} binomial(2*(n+1), n)/(n+1) * x^n / (1+x)^(3*(n+1)).
  • A317014 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 7 * T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2). T(n,k)=0 for n or k < 0.
  • A317016 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 7 * T(n-2,k-1) for k = 0..floor(n/2). T(n,k)=0 for n or k < 0.
  • A317023 (program): Square array A(n,k), n >= 0, k >= 0, read by ascending antidiagonals, where the sequence of row n is the expansion of (1-x^(n+1))/((1-x)^(n+1)).
  • A317026 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 8 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317028 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 8 * T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317044 (program): Numbers k such that A(k+1) = A(k) + 1, where A() = A005100() are the deficient numbers.
  • A317045 (program): Numbers k such that A(k+1) = A(k) + 2, where A() = A005100() are the deficient numbers.
  • A317047 (program): Numbers k such that both k and k + 1 are deficient.
  • A317048 (program): Numbers k such that both k and k + 2 are consecutive deficient numbers.
  • A317050 (program): a(0) = 0 and for any n >= 0, a(n+1) is obtained by changing the rightmost possible digit in the negabinary representation of a(n) so as to get a value not yet in the sequence.
  • A317051 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 9 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317052 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 9 T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317054 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 10 * T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317055 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 10 T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.
  • A317057 (program): a(n) is the number of time-dependent assembly trees satisfying the connected gluing rule for a cycle on n vertices.
  • A317090 (program): Positive integers whose prime multiplicities span an initial interval of positive integers.
  • A317094 (program): a(n) = (n + 1)^2 + n!*L_n(-1), where L_n(x) is the Laguerre polynomial.
  • A317095 (program): a(n) = 40*n.
  • A317096 (program): Expansion of e.g.f. ((1 - x)/(1 - 2*x))*exp(x/(x - 1)).
  • A317100 (program): Number of series-reduced planted achiral trees with n leaves spanning an initial interval of positive integers.
  • A317101 (program): Numbers whose prime multiplicities are pairwise indivisible.
  • A317108 (program): Numbers missing from A317106.
  • A317111 (program): Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 4).
  • A317133 (program): G.f.: Sum_{n>=0} binomial(4*(n+1), n)/(n+1) * x^n / (1+x)^(n+1).
  • A317134 (program): G.f.: Sum_{n>=0} binomial(4*(n+1), n)/(n+1) * x^n / (1+x)^(2*(n+1)).
  • A317137 (program): a(n) is the number of nonzero triangular numbers <= n-th prime.
  • A317138 (program): Numbers k such that (2k)^3 - 1 is a semiprime.
  • A317140 (program): Number of permutations of [2n+1] with exactly n increasing runs of length two.
  • A317163 (program): a(n) = 48277590120607451 + (n-1)*8440735245322380.
  • A317164 (program): a(n) = 55837783597462913 + (n-1)*13858932213216090.
  • A317173 (program): a(n) is the least k > 0 such that k * n contains a digit 1 in its decimal representation.
  • A317180 (program): a(n) is the least positive multiple of n that contains at least one digit 1 in its decimal representation.
  • A317185 (program): Number of edges in a minimum gossip graph on n nodes.
  • A317186 (program): One of many square spiral sequences: a(n) = n^2 + n - floor((n-1)/2).
  • A317187 (program): Arrange primes along the square spiral; sequence lists primes on the X-axis.
  • A317188 (program): a(n) = 1 + 2 * (a(n-1) + a(n-4) + a(n-6)) + a(n-7) for n>3, with initial values 0 if n<0, and 1,3,8,18 for n=0..3.
  • A317189 (program): A morphic sequence related to the ternary Thue-Morse sequence.
  • A317192 (program): A140100(n) - A140102(n).
  • A317193 (program): First differences of A317192.
  • A317198 (program): Yet another version of the ternary tribonacci word: fixed point of the morphism 1 -> 1,0; 0 -> 1,-1; -1 -> 1; starting from a(0) = 1.
  • A317200 (program): G.f.: -x*(2*x^3+2*x^2+x-2)/(x^4-2*x+1).
  • A317202 (program): Decimal expansion of 3 + (t^2+t^4)/2, where t = 0.543689… (A192918) is the real root of x^3+x^2+x=1.
  • A317203 (program): Fixed under the morphism 1 -> 132, 2 -> 1, 3 -> 3, starting with 31.
  • A317207 (program): Length of alternative tribonacci representation of n defined in A317206.
  • A317243 (program): a(n) is the number of open intervals (m, m+1) containing at least one fraction n/k, where m and k are integers between 1 and n.
  • A317255 (program): a(n) = 149836681069944461 + (n-1)*1723457117682300.
  • A317259 (program): a(n) = 136926916457315893 + (n - 1)*9843204333812850.
  • A317276 (program): a(n) = Sum_{k=0..n} binomial(n-1,k-1)*binomial(2*k,k)*n!/(k + 1)!.
  • A317277 (program): a(n) = Sum_{k=0..n} binomial(n-1,k-1)*k^n*n!/k!; a(0) = 1.
  • A317278 (program): a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n-1,k-1)*k^n*n!/k!.
  • A317279 (program): a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n-1,k-1)*n^k*n!/k!.
  • A317280 (program): Expansion of e.g.f. 1/(1 - log(1 + x))^2.
  • A317294 (program): Numbers with a noncomposite number of 1’s in their binary expansion.
  • A317295 (program): Numbers with a composite number of 1’s in their binary expansion.
  • A317297 (program): a(n) = (n - 1)*(4*n^2 - 8*n + 5).
  • A317298 (program): a(n) = (1/2)*(1 + (-1)^n + 2*n + 4*n^2).
  • A317300 (program): Sequence obtained by taking the general formula for generalized k-gonal numbers: m*((k - 2)*m - k + 4)/2, where m = 0, +1, -1, +2, -2, +3, -3, … and k >= 5. Here k = 0.
  • A317301 (program): Sequence obtained by taking the general formula for generalized k-gonal numbers: m*((k - 2)*m - k + 4)/2, where m = 0, +1, -1, +2, -2, +3, -3, … and k >= 5. Here k = 1.
  • A317302 (program): Square array T(n,k) = (n - 2)*(k - 1)*k/2 + k, with n >= 0, k >= 0, read by antidiagonals upwards.
  • A317303 (program): Numbers k such that both Dyck paths of the symmetric representation of sigma(k) have a central peak.
  • A317304 (program): Numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have a central valley.
  • A317308 (program): Primes p such that the largest Dyck path of the symmetric representation of sigma(p) has a central peak.
  • A317309 (program): Primes p such that the largest Dyck path of the symmetric representation of sigma(p) has a central valley.
  • A317311 (program): Multiples of 11 and odd numbers interleaved.
  • A317312 (program): Multiples of 12 and odd numbers interleaved.
  • A317313 (program): Multiples of 13 and odd numbers interleaved.
  • A317314 (program): Multiples of 14 and odd numbers interleaved.
  • A317315 (program): Multiples of 15 and odd numbers interleaved.
  • A317316 (program): Multiples of 16 and odd numbers interleaved.
  • A317317 (program): Multiples of 17 and odd numbers interleaved.
  • A317318 (program): Multiples of 18 and odd numbers interleaved.
  • A317319 (program): Multiples of 19 and odd numbers interleaved.
  • A317320 (program): Multiples of 20 and odd numbers interleaved.
  • A317321 (program): Multiples of 21 and odd numbers interleaved.
  • A317322 (program): Multiples of 22 and odd numbers interleaved.
  • A317323 (program): Multiples of 23 and odd numbers interleaved.
  • A317324 (program): Multiples of 24 and odd numbers interleaved.
  • A317325 (program): Multiples of 25 and odd numbers interleaved.
  • A317326 (program): Multiples of 26 and odd numbers interleaved.
  • A317331 (program): Indices m for which A058304(m) = 1.
  • A317332 (program): Indices m for which A058304(m) = 8.
  • A317333 (program): Indices m for which A058304(m) = 9.
  • A317334 (program): Maximum number of runs in binary strings of length n.
  • A317335 (program): a(n) = A317332(n) - 8*n.
  • A317336 (program): a(n) = A317333(n) - 8*n.
  • A317362 (program): Expansion of e.g.f. exp(exp(x/(1 + x)) - 1).
  • A317364 (program): Expansion of e.g.f. exp(2*x/(1 + x)).
  • A317365 (program): Expansion of e.g.f. x*exp(x/(1 + x))/(1 + x).
  • A317366 (program): Expansion of e.g.f. exp(exp(x/(1 - x)) - 1)/(1 - x).
  • A317404 (program): a(n) = 3*n*(2^n - 1).
  • A317405 (program): a(n) = n * A001353(n).
  • A317406 (program): Expansion of e.g.f. sin(x/(1 - x)).
  • A317407 (program): The “OOPS” numbers – numbers with ones in all odd-numbered positions of the binary representation of n.
  • A317408 (program): a(n) = n * Fibonacci(2n).
  • A317409 (program): Expansion of e.g.f. cos(x/(1 - x)).
  • A317421 (program): a(n) = Sum_{k=1..n} binomial(n-1,k-1)*prime(k)*n!/k!.
  • A317451 (program): a(n) = (n*A003500(n) - A231896(n))/2.
  • A317483 (program): Circuit rank of the n-Bruhat graph.
  • A317487 (program): Number of 4-cycles in the n-Bruhat graph.
  • A317494 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 2 * T(n-3,k-1) for k = 0..floor(n/3); T(n,k)=0 for n or k < 0.
  • A317495 (program): Triangle read by rows: T(0,0) = 1; T(n,k) =2 * T(n-1,k) + T(n-3,k-1) for k = 0..floor(n/3); T(n,k)=0 for n or k < 0.
  • A317496 (program): Triangle T(n,k) = T(n-1,k) + 3*T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.
  • A317497 (program): Triangle T(n,k) = 3*T(n-1,k) + T(n-3,k-1) for k = 0..floor(n/3) with T(0,0) = 1 and T(n,k) = 0 for n or k < 0, read by rows.
  • A317498 (program): Triangle read by rows of coefficients in expansions of (-2 + 3x)^n, where n is nonnegative integer.
  • A317499 (program): Coefficients in expansion of 1/(1 + 2*x - 3*x^3).
  • A317500 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 2 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0.
  • A317501 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 2 T(n-1,k) + T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0.
  • A317509 (program): Coefficients in Expansion of 1/(1 + x - 2*x^5).
  • A317510 (program): Numbers (4p+1)/3 where p is a Sophie Germain prime p > 3.
  • A317512 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
  • A317513 (program): Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
  • A317527 (program): Number of edges in the n-alternating group graph.
  • A317528 (program): Expansion of Sum_{k>=1} mu(k)^2*x^k/(1 + x^k), where mu() is the Moebius function (A008683).
  • A317529 (program): Expansion of Sum_{k>=1} x^(k^2)/(1 + x^(k^2)).
  • A317531 (program): Expansion of Sum_{p prime, k>=1} x^(p^k)/(1 + x^(p^k)).
  • A317534 (program): Numbers k such that the poset of factorizations of k, ordered by refinement, is not a lattice.
  • A317535 (program): Expansion of 1/(1 + 1/(1 - x) - Product_{k>=1} 1/(1 - x^k)).
  • A317538 (program): Indices m for which A317413(m) = 1.
  • A317542 (program): Formal inverse of the period-doubling sequence A096268.
  • A317543 (program): Positions of 1’s in A317542, the formal inverse of the period-doubling sequence A096268.
  • A317544 (program): Positions of 0’s in A317542, the formal inverse of the period-doubling sequence A096268.
  • A317551 (program): Fertility numbers.
  • A317553 (program): Sum of coefficients in the expansion of Sum_{y a composition of n} p(y) in terms of Schur functions, where p is power-sum symmetric functions.
  • A317581 (program): a(1) = 1; a(n > 1) = 1 + Sum_{d|n, d<n} mu(n/d) a(d).
  • A317591 (program): Lexicographically earliest sequence of distinct terms such that erasing the last digit of a(n+1) and adding the resulting integer to a(n) gives back a(n+1).
  • A317592 (program): Lexicographically first sequence of different terms such that erasing the last two digits of a(n+1) and adding this new reshaped integer to a(n) gives back a(n+1).
  • A317594 (program): Lexicographically first sequence of different terms such that erasing the last three digits of a(n+1) and adding this new reshaped integer to a(n) gives back a(n+1).
  • A317613 (program): Permutation of the nonnegative integers: lodumo_4 of A047247.
  • A317614 (program): a(n) = (1/2)*(n^3 + n*(n mod 2)).
  • A317618 (program): Expansion of e.g.f. sqrt((1 - x)/(1 - 3*x)).
  • A317625 (program): a(n) = Sum_{k=1..n} phi(floor(n/k)) where phi is the Euler totient function.
  • A317626 (program): Intersections with the x-axis of a bouncing ball on a Sophie Germain billiard table.
  • A317633 (program): Numbers congruent to {1, 7, 9} mod 10.
  • A317637 (program): a(n) = n*(n+1)*(n+3).
  • A317639 (program): Number of equivalence classes of Dyck paths of semilength n for the consecutive pattern UDUDD, where U=(1,1) and D=(1,-1).
  • A317640 (program): The 7x+-1 function: a(n) = 7n+1 if n == +1 (mod 4), a(n) = 7n-1 if n == -1 (mod 4), otherwise a(n) = n/2.
  • A317645 (program): Expansion of (1 + theta_3(q))^3*(1 + theta_3(q^2))/16, where theta_3() is the Jacobi theta function.
  • A317646 (program): Expansion of (1 + theta_3(q))^2*(1 + theta_3(q^2))^2/16, where theta_3() is the Jacobi theta function.
  • A317657 (program): Numbers congruent to {15, 75, 95} mod 100.
  • A317665 (program): Expansion of 1/Sum_{k>=0} x^(k^2).
  • A317669 (program): Number of equivalence classes of binary words of length n for the subword 10110.
  • A317673 (program): Moebius transform of A129502.
  • A317713 (program): Number of distinct terminal subtrees of the rooted tree with Matula-Goebel number n.
  • A317714 (program): Chessboard rectangles sequence (see Comments), also A037270 interleaved with A163102.
  • A317729 (program): Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.
  • A317735 (program): Number of nX2 0..1 arrays with every element unequal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317753 (program): Number of steps to reach 1 in 7x+-1 problem, or -1 if 1 is never reached.
  • A317759 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1 or 2 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317760 (program): Number of nX4 0..1 arrays with every element unequal to 0, 1 or 2 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317767 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317774 (program): a(n) = A322667(n) + 1.
  • A317783 (program): Number of equivalence classes of binary words of length n for the set of subwords {010, 101}.
  • A317790 (program): a(n) = 2*a(n-1) - a(n-2) + a(n-4) - 2*(n-5) + a(n-6) for n>5, a(0)=a(1)=1, a(2)=a(3)=7, a(4)=13, a(5)=19.
  • A317793 (program): a(n) = (4^n + (-3)^n + 2^n + (-1)^n)/2.
  • A317809 (program): Number of nX2 0..1 arrays with every element unequal to 0, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317817 (program): Number of nX2 0..1 arrays with every element unequal to 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317837 (program): a(n) = Sum_{d|n, d<n} A002487(d).
  • A317838 (program): a(n) = Sum_{d|n} A002487(d).
  • A317848 (program): Multiplicative with a(p^e) = binomial(2*e, e).
  • A317849 (program): Number of states of the Finite State Automaton Gn accepting the language of maximal (or minimal) lexicographic representatives of elements in the positive braid monoid An.
  • A317890 (program): Number of nX2 0..1 arrays with every element unequal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A317910 (program): Expansion of -1/(1 - x)^2 + (1/(1 - x))*Product_{k>=1} (1 + x^k).
  • A317912 (program): Expansion of Product_{k>=2} 1/(1 - k*x^k).
  • A317914 (program): a(n) = 142099325379199423 + (n-1)*3691994023167450.
  • A317934 (program): Multiplicative with a(p^n) = 2^A011371(n); denominators for certain “Dirichlet Square Roots” sequences.
  • A317943 (program): Filter sequence constructed from the coefficients of the Stern polynomials B(d,t) collected for each proper divisor d of n; Restricted growth sequence transform of A317942.
  • A317946 (program): Additive with a(p^n) = A011371(n); the 2-adic valuation of A317934(n).
  • A317948 (program): An example of a morphic word: the sorted (by length, then alphabetically) sequence of words of the form a*b* under the action of a finite automaton defined as follows: start state is 0; a and b map states [0, 1, 2, 3] to states [1, 2, 3, 0] and [0, 3, 1, 2], respectively.
  • A317950 (program): First differences of ternary tribonacci word A080843.
  • A317951 (program): An S-automatic sequence for the system S = (a*b*, {a,b}, a<b).
  • A317952 (program): Trajectory of 1 under repeated application of the morphism 1->121, 2->232, 3->343, 4->414.
  • A317960 (program): Trajectory of 12 under the morphism f: X -> XYX, where Y=1 if X contains an odd number of 1’s, otherwise Y = 2.
  • A317961 (program): Trajectory of 10 under the morphism f: X -> XYX, where Y=1 if X contains an odd number of 1’s, otherwise Y = 0.
  • A317973 (program): a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms -1, 2, 3, 6.
  • A317974 (program): a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms 0,0,1,1.
  • A317975 (program): a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms 0, 1, 1, 0.
  • A317976 (program): a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms 0,0,1,0.
  • A317980 (program): a(n) = Product_{i=1..n} floor(5*i/2).
  • A317982 (program): Expansion of 14*x*(29 + 784*x + 1974*x^2 + 784*x^3 + 29*x^4) / (1 - x)^7.
  • A317983 (program): Expansion of 420*x*(1 + x)*(1 + 10*x + x^2) / (1 - x)^6.
  • A317984 (program): Expansion of 140*x*(1 + 4*x + x^2) / (1 - x)^5.
  • A317990 (program): Number of genera of real quadratic field Q(sqrt(k)), k squarefree > 1.
  • A317992 (program): 2-rank of the narrow class group of real quadratic field Q(sqrt(k)), k squarefree > 1.
  • A317996 (program): Expansion of e.g.f. exp((1 - exp(-3*x))/3).
  • A318010 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318018 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1, 2 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318025 (program): Expansion of Sum_{k>=1} (-1 + Product_{j>=1} 1/(1 - j*x^(k*j))).
  • A318026 (program): Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(3*k))).
  • A318027 (program): Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(4*k))).
  • A318029 (program): Expansion of Sum_{k>=2} x^(k*(k+3)/2) / Product_{j=1..k} (1 - x^j).
  • A318031 (program): Number of nX2 0..1 arrays with every element unequal to 0, 1, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318039 (program): Number of nX2 0..1 arrays with every element unequal to 0, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318047 (program): a(n) = sum of values taken by all parking functions of length n.
  • A318054 (program): a(n) = n*(n + 1)*(n^2 + n + 22)/24.
  • A318059 (program): a(n) is the numerator of sigma(sigma(n))/n.
  • A318060 (program): a(n) is the denominator of sigma(sigma(n))/n.
  • A318062 (program): Number of nX2 0..1 arrays with every element unequal to 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318111 (program): Number of maximal 1-intersecting families of 2-sets of [n] = {1,2,…,n}.
  • A318113 (program): Number of compositions of n into exactly n nonnegative parts <= five.
  • A318114 (program): Number of compositions of n into exactly n nonnegative parts <= six.
  • A318115 (program): Number of compositions of n into exactly n nonnegative parts <= seven.
  • A318116 (program): Number of compositions of n into exactly n nonnegative parts <= eight.
  • A318117 (program): Number of compositions of n into exactly n nonnegative parts <= ten.
  • A318151 (program): e-numbers of unlabeled rooted trees with empty leaves o[] allowed. A number n is in the sequence iff n = 2^(prime(y_1) * … * prime(y_k)) for some k >= 0 and y_1, …, y_k already in the sequence.
  • A318155 (program): Expansion of (1/(1 - x)) * Sum_{k>=0} x^(k*(2*k+1)) / Product_{j=1..2*k} (1 - x^j).
  • A318156 (program): Expansion of (1/(1 - x)) * Sum_{k>=1} x^(k*(2*k-1)) / Product_{j=1..2*k-1} (1 - x^j).
  • A318158 (program): Prime numbers of the form p1^4 + p2^3 + p3^2 + p4, where p1, p2, p3 and p4 are distinct primes.
  • A318159 (program): Figurate numbers based on the small stellated dodecahedron: a(n) = n*(21*n^2 - 33*n + 14)/2.
  • A318161 (program): Number of compositions of 2n into exactly 2n nonnegative parts with largest part n.
  • A318162 (program): Number of compositions of 2n-1 into exactly 2n-1 nonnegative parts with largest part n.
  • A318179 (program): Expansion of e.g.f. exp((1 - exp(-4*x))/4).
  • A318180 (program): Expansion of e.g.f. exp((1 - exp(-5*x))/5).
  • A318181 (program): Expansion of e.g.f. exp((1 - exp(-6*x))/6).
  • A318192 (program): a(n) = U_{n}(n)/(n+1) where U_{n}(x) is a Chebyshev polynomial of the second kind.
  • A318197 (program): a(n) = 2^((n - 1)*(n + 2)/2)*3^(n*(n - 1))*n^n.
  • A318206 (program): Numbers having no divisor d > 1 that is a binary palindrome (i.e., an element of A006995).
  • A318215 (program): Expansion of e.g.f. exp(x/(1 + x)^2).
  • A318223 (program): Expansion of e.g.f. exp(x/(1 + 2*x)).
  • A318224 (program): a(n) = n! * [x^n] exp(x/(1 + n*x)).
  • A318236 (program): a(n) = (3*2^(4*n+3) + 1)/5.
  • A318241 (program): Column 3 of array in A318240.
  • A318249 (program): a(n) = (n - 1)! * d(n), where d(n) = number of divisors of n (A000005).
  • A318250 (program): a(n) = (n - 1)! * sigma_2(n), where sigma_2(n) = sum of squares of divisors of n (A001157).
  • A318274 (program): Triangle read by rows: T(n,k) = n for 0 < k < n and T(n,0) = T(n,n) = 1.
  • A318283 (program): Sum of elements of the multiset spanning an initial interval of positive integers with multiplicities equal to the prime indices of n in weakly decreasing order.
  • A318290 (program): Expansion of Sum_{k>=1} (-1 + Product_{j>=1} (1 + j*x^(k*j))).
  • A318296 (program): Number of conjugacy classes of the Sylow 2-subgroup of the alternating group on n letters.
  • A318297 (program): a(n) = ((2n - 1)! + (4n - 2)!/(2n - 1)!)/(4n - 1).
  • A318303 (program): a(0) = 0, a(n) = n + a(n-1) if n is odd, a(n) = -3*a(n/2) if n is even.
  • A318304 (program): a(n) = A083254(n)/A003557(n) = (2*A173557(n) - A007947(n)).
  • A318305 (program): a(n) = product_{p} - product_{p-1}, where p are distinct primes dividing n; a(n) = A007947(n) - A173557(n).
  • A318314 (program): Denominators of the sequence whose Dirichlet convolution with itself yields A068068, number of odd unitary divisors of n.
  • A318315 (program): The 2-adic valuation of A318314.
  • A318320 (program): a(n) = (psi(n) - phi(n))/2.
  • A318321 (program): Numerators of rational valued sequence whose Dirichlet convolution with itself yields A003961.
  • A318325 (program): a(n) = Sum_{d|n} [moebius(n/d) > 0]*(sigma(d)-d).
  • A318326 (program): a(n) = Sum_{d|n} [moebius(n/d) < 0]*(sigma(d)-d).
  • A318327 (program): The 10-adic integer a_0 = …34474674850 satisfying a_0^5 + 1 = a_1, a_1^5 + 1 = a_2, …, a_8^5 + 1 = a_9 and a_9^5 + 1 = a_0.
  • A318328 (program): The 10-adic integer a_1 = …67812500001 satisfying a_1^5 + 1 = a_2, a_2^5 + 1 = a_3, … , a_9^5 + 1 = a_0 and a_0^5 + 1 = a_1.
  • A318329 (program): The 10-adic integer a_2 = …39062500002 satisfying a_2^5 + 1 = a_3, a_3^5 + 1 = a_4, … , a_0^5+ 1 = a_1 and a_1^5 + 1 = a_2.
  • A318330 (program): The 10-adic integer a_3 = …25000000033 satisfying a_3^5 + 1 = a_4, a_4^5 + 1 = a_5, … , a_1^5+ 1 = a_2 and a_2^5 + 1 = a_3.
  • A318331 (program): The 10-adic integer a_4 = …25039135394 satisfying a_4^5 + 1 = a_5, a_5^5 + 1 = a_6, … , a_2^5+ 1 = a_3 and a_3^5 + 1 = a_4.
  • A318332 (program): The 10-adic integer a_5 = …85011784225 satisfying a_5^5 + 1 = a_6, a_6^5 + 1 = a_7, … , a_3^5 + 1 = a_4 and a_4^5 + 1 = a_5.
  • A318333 (program): The 10-adic integer a_6 = …17275390626 satisfying a_6^5 + 1 = a_7, a_7^5 + 1 = a_8, … , a_4^5 + 1 = a_5 and a_5^5 + 1 = a_6.
  • A318334 (program): The 10-adic integer a_7 = …89599609377 satisfying a_7^5 + 1 = a_8, a_8^5 + 1 = a_9, … , a_5^5 + 1 = a_6 and a_6^5 + 1 = a_7.
  • A318335 (program): The 10-adic integer a_8 = …74462890658 satisfying a_8^5 + 1 = a_9, a_9^5 + 1 = a_0, … , a_6^5 + 1 = a_7 and a_7^5 + 1 = a_8.
  • A318336 (program): The 10-adic integer a_9 = …75576244769 satisfying a_9^5 + 1 = a_0, a_0^5 + 1 = a_1, … , a_7^5 + 1 = a_8 and a_8^5 + 1 = a_9.
  • A318338 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A318368 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d*2^(d-1).
  • A318369 (program): Number of non-isomorphic set multipartitions (multisets of sets) of the multiset of prime indices of n.
  • A318370 (program): Number of non-isomorphic strict set multipartitions (sets of sets) of the multiset of prime indices of n.
  • A318372 (program): a(1) = 1; a(n+1) = Sum_{d|n} d*a(d).
  • A318376 (program): a(n) = F(n+1)^3 - 3*F(n-1)*F(n)^2, where F(n) = A000045(n), the n-th Fibonacci number.
  • A318379 (program): The 10-adic integer a_0 = …7644773889965429250 satisfying a_0^9 + 1 = a_1, a_1^9 + 1 = a_2, … , a_8^9 + 1 = a_9 and a_9^9 + 1 = a_0.
  • A318380 (program): The 10-adic integer a_1 = …7705078125000000001 satisfying a_1^9 + 1 = a_2, a_2^9 + 1 = a_3, … , a_9^9 + 1 = a_0 and a_0^9 + 1 = a_1.
  • A318381 (program): The 10-adic integer a_2 = …9345703125000000002 satisfying a_2^9 + 1 = a_3, a_3^9 + 1 = a_4, … , a_0^9 + 1 = a_1 and a_1^9 + 1 = a_2.
  • A318382 (program): The 10-adic integer a_3 = …2500000000000000513 satisfying a_3^9 + 1 = a_4, a_4^9 + 1 = a_5, … , a_1^9 + 1 = a_2 and a_2^9 + 1 = a_3.
  • A318383 (program): The 10-adic integer a_4 = …8996619787545743874 satisfying a_4^9 + 1 = a_5, a_5^9 + 1 = a_6, … , a_2^9 + 1 = a_3 and a_3^9 + 1 = a_4.
  • A318384 (program): The 10-adic integer a_5 = …3747888971752538625 satisfying a_5^9 + 1 = a_6, a_6^9 + 1 = a_7, … , a_3^9 + 1 = a_4 and a_4^9 + 1 = a_5.
  • A318385 (program): The 10-adic integer a_6 = …1601963043212890626 satisfying a_6^9 + 1 = a_7, a_7^9 + 1 = a_8, … , a_4^9 + 1 = a_5 and a_5^9 + 1 = a_6.
  • A318386 (program): The 10-adic integer a_7 = …5448818206787109377 satisfying a_7^9 + 1 = a_8, a_8^9 + 1 = a_9, … , a_5^9 + 1 = a_6 and a_6^9 + 1 = a_7.
  • A318397 (program): Triangle read by rows: T(n,k) = binomial(n,k)^2 * binomial(2*(n-k), n-k).
  • A318400 (program): Numbers whose prime indices are all powers of 2 (including 1).
  • A318403 (program): Number of strict connected antichains of sets whose multiset union is an integer partition of n.
  • A318406 (program): For n > 4, a(n) = a(n-1) + a(n-2) if n is even and a(n) = 3*a(n-2) + a(n-4) - a(n-5) if n is odd; a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2, and a(4) = 3.
  • A318409 (program): The 10-adic integer a_8 = …6396884918212891138 satisfying a_8^9 + 1 = a_9, a_9^9 + 1 = a_0, … , a_6^9 + 1 = a_7 and a_7^9 + 1 = a_8.
  • A318410 (program): The 10-adic integer a_9 = …5099734869332853249 satisfying a_9^9 + 1 = a_0, a_0^9 + 1 = a_1, … , a_7^9 + 1 = a_8 and a_8^9 + 1 = a_9.
  • A318411 (program): Least k (>1) such that m^k == m mod A005117(n) for 0 <= m <= A005117(n) - 1.
  • A318417 (program): Scaled g.f. T(u) = Sum_{n>=0} a(n)*(3*u/48)^n satisfies 3*(2*u-1)*T + d/du(4*u*(2*u-1)*(u-1)*T’) = 0, and a(0)=1; sequence gives a(n).
  • A318435 (program): Decimal expansion of the nominal Jovian mass parameter in m^3 s^-2.
  • A318436 (program): Decimal expansion of the nominal solar mass parameter in m^3 s^-2.
  • A318438 (program): For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let h(n) = Sum_{k=0..w} b_k * (i-1)^k (where i denotes the imaginary unit); a(n) is the real part of h(n).
  • A318439 (program): For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let h(n) = Sum_{k=0..w} b_k * (i-1)^k (where i denotes the imaginary unit); a(n) is the imaginary part of h(n).
  • A318440 (program): a(n) = A046645(n) - A007814(n); the 2-adic valuation of A299150.
  • A318445 (program): a(n) = Sum_{d|n, d<n} A005187(d).
  • A318446 (program): Inverse Möbius transform of A005187: a(n) = Sum_{d|n} A005187(d).
  • A318447 (program): a(n) = Sum_{d|n, d<n} A294898(d), where A294898(d) = A005187(d) - sigma(d).
  • A318448 (program): a(n) = Sum_{d|n} A294898(d), where A294898(d) = A005187(d) - sigma(d).
  • A318449 (program): Numerators of the sequence whose Dirichlet convolution with itself yields A001511, the 2-adic valuation of 2n.
  • A318450 (program): Denominators of the sequence whose Dirichlet convolution with itself yields A001511, the 2-adic valuation of 2n.
  • A318451 (program): The 2-adic valuation of A318450.
  • A318453 (program): Numerators of the sequence whose Dirichlet convolution with itself yields A001227, number of odd divisors of n.
  • A318454 (program): Denominators of the sequence whose Dirichlet convolution with itself yields A001227, number of odd divisors of n.
  • A318455 (program): The 2-adic valuation of A318454(n).
  • A318456 (program): a(n) = n OR A001065(n), where OR is bitwise-or (A003986) and A001065 = sum of proper divisors.
  • A318457 (program): a(n) = n XOR A001065(n), where XOR is bitwise-xor (A003987) and A001065 = sum of proper divisors.
  • A318458 (program): a(n) = n AND A001065(n), where AND is bitwise-and (A004198) & A001065 = sum of proper divisors.
  • A318459 (program): a(n) = gcd(n, tau(n), phi(n)), where tau = A000005 and phi = A000010.
  • A318466 (program): a(n) = 2*n OR A000203(n), where OR is bitwise-or (A003986) and A000203 = sum of divisors.
  • A318467 (program): a(n) = 2*n XOR A000203(n), where XOR is bitwise-xor (A003987) and A000203 = sum of divisors.
  • A318468 (program): a(n) = 2*n AND A000203(n), where AND is bitwise-and (A004198) and A000203 = sum of divisors.
  • A318471 (program): Additive with a(p^e) = A000045(e).
  • A318472 (program): Multiplicative with a(p^e) = 2^A000045(e).
  • A318473 (program): Additive with a(p^e) = A000045(e+1).
  • A318474 (program): Multiplicative with a(p^e) = 2^A000045(e+1).
  • A318491 (program): a(n) is the numerator of Sum_{d|n} Sum_{j|d} 1/j.
  • A318492 (program): a(n) is the denominator of Sum_{d|n} Sum_{j|d} 1/j.
  • A318493 (program): Expansion of 1/(1 - Sum_{i>=1, j>=1} i*j*x^(i*j)).
  • A318505 (program): Sum of divisors of n, up to, but not including the second largest of them A032742(n); a(1) = 0 by convention.
  • A318512 (program): Denominators (in their lowest terms) of the sequence whose Dirichlet convolution with itself yields squares (A000290), or equally A064549.
  • A318513 (program): The 2-adic valuation of A318512.
  • A318514 (program): a(n) = n OR (greatest proper divisor of n).
  • A318515 (program): a(n) = n AND A032742(n), where AND is bitwise-and (A004198) and A032742 = the largest proper divisor of n.
  • A318516 (program): a(n) = A032742(n) OR n-A032742(n), where OR is bitwise-or (A003986) and A032742 = the largest proper divisor of n.
  • A318517 (program): a(n) = A032742(n) XOR n-A032742(n), where XOR is bitwise-xor (A003987) and A032742 = the largest proper divisor of n.
  • A318518 (program): a(n) = A032742(n) AND n-A032742(n), where AND is bitwise-and (A004198) and A032742 = the largest proper divisor of n.
  • A318519 (program): a(n) = A000005(n) * A003557(n).
  • A318522 (program): Decimal expansion of sqrt(28^(1/3)-27^(1/3)).
  • A318525 (program): Decimal expansion of ((3+2*5^(1/4))/(3-2*5^(1/4)))^(1/4).
  • A318556 (program): a(n) is the number of lesser tetrahedral numbers that divide the n-th tetrahedral number.
  • A318570 (program): Expansion of Product_{k>=1} ((1 - x)^k + x^k)/((1 - x)^k - x^k).
  • A318583 (program): a(1) = a(2) = 1; for n > 2, a(n+2) = Sum_{d|n} mu(n/d)*a(d).
  • A318591 (program): Number of n-member subsets of [3*n] whose elements sum to a multiple of three.
  • A318605 (program): Decimal expansion of geometric progression constant for Coxeter’s Loxodromic Sequence of Tangent Circles.
  • A318608 (program): Moebius function mu(n) defined for the Gaussian integers.
  • A318609 (program): a(1) = 2, a(2) = 4, a(3) = 6; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).
  • A318610 (program): a(1) = 0, a(2) = 4, a(3) = 12; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).
  • A318614 (program): Scaled g.f. S(u) = Sum_{n>0} a(n)*16*(u/16)^n satisfies T(u) = d/du S(u), with T(u) as defined by A318417; sequence gives a(n).
  • A318618 (program): a(n) is the number of rooted forests on n nodes that avoid the patterns 321, 2143, and 3142.
  • A318623 (program): a(n) = 2^phi(n) mod n.
  • A318624 (program): Number of 3-member subsets of [3*n] whose elements sum to a multiple of n.
  • A318636 (program): G.f.: Sum_{n>=1} ( (1 + x^n)^n - 1 ).
  • A318637 (program): G.f.: Sum_{n>=1} ( (2 + x^n)^n - 2^n ).
  • A318651 (program): a(n) = A046644(n)/A318512(n).
  • A318652 (program): The 2-adic valuation of A046644(n)/A318512(n) (A318651).
  • A318654 (program): Positions of even terms in A318649.
  • A318655 (program): The 2-adic valuation of A318649, the numerators of “Dirichlet Square Root” of squares.
  • A318656 (program): The 2-adic valuation of ratio A318649(n)/A318512(n); a(n) = 2*A007814(n) - A046645(n).
  • A318658 (program): Denominators of the sequence whose Dirichlet convolution with itself yields A087003, a(2n) = 0 and a(2n+1) = moebius(2n+1).
  • A318659 (program): The 2-adic valuation of A318658.
  • A318660 (program): Remainder when A064988(n) is divided by n.
  • A318666 (program): a(n) = 2^{the 3-adic valuation of n}.
  • A318668 (program): a(n) = gcd(n, A064988(n)).
  • A318674 (program): Sum of squarefree divisors of n that have an even number of prime factors.
  • A318675 (program): Sum of squarefree divisors of n that have an odd number of prime factors.
  • A318676 (program): Sum of divisors of n that have an even number of prime factors (counted with multiplicity).
  • A318677 (program): Sum of divisors of n that have an odd number of prime factors (counted with multiplicity).
  • A318681 (program): a(n) = n * A299149(n).
  • A318682 (program): a(n) is the number of odd values minus the number of even values of the integer log of all positive integers up to and including n.
  • A318695 (program): Expansion of e.g.f. Product_{i>=1, j>=1} 1/(1 - x^(i*j))^(1/(i*j)).
  • A318696 (program): Expansion of e.g.f. Product_{i>=1, j>=1} (1 + x^(i*j))^(1/(i*j)).
  • A318700 (program): Positive numbers that contain odd and even digits.
  • A318702 (program): For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let f(n) = Sum_{k=0..w} b_k * i^k * 2^floor(k/2) (where i denotes the imaginary unit); a(n) is the real part of f(n).
  • A318703 (program): For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let f(n) = Sum_{k=0..w} b_k * i^k * 2^floor(k/2) (where i denotes the imaginary unit); a(n) is the imaginary part of f(n).
  • A318704 (program): For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let f(n) = Sum_{k=0..w} b_k * i^k * 2^floor(k/2) (where i denotes the imaginary unit); a(n) is the square of the modulus of f(n).
  • A318720 (program): Numbers k such that there exists a strict relatively prime factorization of k in which no pair of factors is relatively prime.
  • A318733 (program): Decimal expansion of the nontrivial real solution to x^6 + x^5 - x^3 - x^2 - x + 1 = 0.
  • A318734 (program): a(n) = Sum_{k=1..n} (-1)^(k + 1) * d(2*k - 1), where d(k) is the number of divisors of k (A000005).
  • A318739 (program): Decimal expansion of Pi^2 / 24 - (1/12) * log(2 + sqrt(5))^2.
  • A318742 (program): a(n) = Sum_{k=1..n} floor(n/k)^3.
  • A318743 (program): a(n) = Sum_{k=1..n} floor(n/k)^4.
  • A318744 (program): a(n) = Sum_{k=1..n} floor(n/k)^5.
  • A318750 (program): a(n) = Sum_{k=1..n} k * tau_3(k), where tau_3 is A007425.
  • A318755 (program): a(n) = Sum_{k=1..n} tau(k)^3, where tau is A000005.
  • A318762 (program): Number of permutations of a multiset whose multiplicities are the prime indices of n.
  • A318765 (program): a(n) = (n + 2)*(n^2 + n - 1).
  • A318766 (program): a(0) = 1; for n > 0, a(n) = (prime(n)^2 - 1) * a(n-1).
  • A318768 (program): a(n) = Sum_{d|n} (-1)^(n/d+1) * Sum_{j|d} tau(j), where tau = number of divisors (A000005).
  • A318769 (program): Expansion of e.g.f. Product_{k>=1} (1 + x^k)^(sigma(k)/k), where sigma(k) is the sum of the divisors of k.
  • A318772 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 3 * T(n-4,k-1) for k = 0..floor(n/4); T(n,k)=0 for n or k < 0.
  • A318773 (program): Triangle T(n,k) = 3*T(n-1,k) + T(n-4,k-1) for k = 0..floor(n/4), with T(0,0) = 1 and T(n,k) = 0 for n or k < 0, read by rows.
  • A318774 (program): Coefficients in expansion of 1/(1 - x - 3*x^4).
  • A318775 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 2 * T(n-5,k-1) for k = 0..floor(n/5); T(n,k)=0 for n or k < 0.
  • A318776 (program): Triangle read by rows: T(0,0) = 1; T(n,k) = 2 T(n-1,k) + T(n-5,k-1) for k = 0..floor(n/5); T(n,k)=0 for n or k < 0.
  • A318777 (program): Coefficients in expansion of 1/(1 - x - 2*x^5).
  • A318778 (program): Number of different positions that an elementary sphinx can occupy in a sphinx of order n.
  • A318784 (program): Expansion of Product_{k>=1} 1/(1 - x^k)^(sigma_1(k)-k), where sigma_1(k) = sum of divisors of k (A000203).
  • A318785 (program): Numbers which are prime if each digit is replaced by its 9’s complement.
  • A318791 (program): Prime generating polynomial: a(n) = 9*n^2 - 249*n + 1763.
  • A318809 (program): Number of necklace permutations of the multiset of prime indices of n > 1.
  • A318811 (program): Expansion of e.g.f. exp(Sum_{k>=1} phi(k)*x^k), where phi is the Euler totient function A000010.
  • A318814 (program): Expansion of e.g.f. Product_{k>=1} ((1 + x^k)/(1 - x^k))^(sigma(k)/k).
  • A318827 (program): a(n) = n - gcd(n - 1, phi(n)).
  • A318828 (program): a(n) = n - A063994(n) = n - Product_{primes p dividing n} gcd(p-1, n-1).
  • A318830 (program): a(n) = phi(n) - gcd(phi(n), n-1).
  • A318833 (program): a(n) = n + A023900(n).
  • A318834 (program): a(n) = Product_{d|n, d<n} A019565(phi(d)), where phi is the Euler totient function A000010.
  • A318840 (program): a(n) = phi(n) - Product_{primes p dividing n} gcd(p-1, n-1).
  • A318841 (program): a(n) = n - A173557(n).
  • A318845 (program): a(n) = Sum_{d|n} (-1)^(n/d+1) * Sum_{j|d} sigma(j), where sigma(j) = sum of divisors of j (A000203).
  • A318868 (program): a(n) = 1^2 + 3^4 + 5^6 + 7^8 + 9^10 + 11^12 + 13^14 + … + (up to n).
  • A318874 (program): Number of divisors d of n for which 2*phi(d) > d.
  • A318875 (program): Number of divisors d of n for which 2*phi(d) < d.
  • A318876 (program): Sum of divisors d of n for which 2*phi(d) > d.
  • A318877 (program): Sum of divisors d of n for which 2*phi(d) < d.
  • A318878 (program): Sum of A083254(d) for all such divisors d of n for which A083254(d) > 0.
  • A318879 (program): a(n) = Sum_{d|n} [d-(2*phi(d)) > 0]*(d-(2*phi(d))).
  • A318885 (program): If n = p^a * q^b * … * r^c, with p < q < r primes, with nonzero exponents a, b, c, then a(n) = prime(1+p-p)^a * prime(1+q-p)^b * … * prime(1+r-p)^c; a(1) = 1.
  • A318889 (program): a(n) = A001065(n) - A001065(A252463(n)).
  • A318912 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^k)^(mu(k)^2/k), where mu = Möbius function (A008683).
  • A318913 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^prime(k))^(1/prime(k)).
  • A318914 (program): Expansion of e.g.f. Product_{p prime, k>=1} 1/(1 - x^(p^k))^(1/(p^k)).
  • A318917 (program): Expansion of e.g.f. exp(Sum_{k>=1} phi(k)*x^k/k), where phi is the Euler totient function A000010.
  • A318919 (program): Define b(0)=0, b(1)[1]=1, b(1)[2]=1; and for n>=2, b(n)[1] = total number of digits in b(n-1), and b(n)[2] = total number of digits in b(0),…,b(n-1); a(n) = b(n)[2].
  • A318921 (program): In binary expansion of n, delete one symbol from each run. Set a(n)=0 if the result is the empty string.
  • A318922 (program): Apply Lenormand’s transformation k -> A318921(k) to the Fibonacci numbers.
  • A318923 (program): Apply Lenormand’s transformation k -> A318921(k) to the primes.
  • A318926 (program): Take the binary expansion of n, starting with the least significant bit, and concatenate the lengths of the runs.
  • A318927 (program): Take the binary expansion of n, starting with the most significant bit, and concatenate the lengths of the runs.
  • A318930 (program): RUNS transform of A279620.
  • A318934 (program): Numbers whose binary expansion begins with exactly two 1’s.
  • A318935 (program): a(n) = Sum_{2^m divides n} 2^(3*m).
  • A318937 (program): a(n) = 16 times the sum of the cubes of the divisors of 2*n+1.
  • A318938 (program): If n=0 then 1 otherwise 16*(1+22*A318935(n))*(sum of cubes of odd divisors of n).
  • A318939 (program): If n=0 then 1 otherwise 48*(1+12*A318935(n))*(sum of cubes of odd divisors of n).
  • A318941 (program): Number of Dyck paths with n nodes and altitude 2.
  • A318946 (program): Column 1 of triangle A318945.
  • A318947 (program): Column 2 of triangle A318945.
  • A318960 (program): One of the two successive approximations up to 2^n for 2-adic integer sqrt(-7). This is the 1 (mod 4) case.
  • A318961 (program): One of the two successive approximations up to 2^n for 2-adic integer sqrt(-7). This is the 3 (mod 4) case.
  • A318962 (program): Digits of one of the two 2-adic integers sqrt(-7) that ends in 01.
  • A318963 (program): Digits of one of the two 2-adic integers sqrt(-7) that ends in 11.
  • A318966 (program): Expansion of e.g.f. Product_{i>=1, j>=1, k>=1} 1/(1 - x^(i*j*k))^(1/(i*j*k)).
  • A318967 (program): Expansion of e.g.f. Product_{i>=1, j>=1, k>=1} (1 + x^(i*j*k))^(1/(i*j*k)).
  • A318968 (program): Expansion of exp(Sum_{k>=1} ( Sum_{d|k, d odd} d^k ) * x^k/k).
  • A318969 (program): Expansion of exp(Sum_{k>=1} ( Sum_{p|k, p prime} p^k ) * x^k/k).
  • A318972 (program): The 7x+-1 function (“shortcut” definition): a(n) = (7n+1)/4 if n == +1 (mod 4), a(n) = (7n-1)/4 if n == -1 (mod 4), otherwise a(n) = n/2.
  • A318976 (program): Expansion of e.g.f. Product_{k>=1} ((1 + x^k)/(1 - x^k))^(phi(k)/k), where phi is the Euler totient function A000010.
  • A318978 (program): Heinz numbers of integer partitions with a common divisor > 1.
  • A318979 (program): Number of divisors of n with relatively prime prime indices, meaning they belong to A289509.
  • A318981 (program): Numbers whose prime indices plus 1 are relatively prime.
  • A318994 (program): Totally additive with a(prime(n)) = n + 1.
  • A318995 (program): Totally additive with a(prime(n)) = n - 1.
  • A319006 (program): Sum of the next n positive integers repeated (A008619).
  • A319007 (program): Sum of the next n nonnegative integers repeated (A004526).
  • A319010 (program): a(0) = 0, a(1) = 1; for n >= 1, a(2*n) = a(2*n-1), a(2*n+1) = 2*(n - a(n)).
  • A319013 (program): a(n) is the sum over each permutation of S_n of the least element of the descent set.
  • A319014 (program): a(n) = 1*2*3 + 4*5*6 + 7*8*9 + 10*11*12 + 13*14*15 + 16*17*18 + … + (up to n).
  • A319028 (program): Number of permutations pi of [n] such that s(pi) avoids the patterns 132 and 321, where s is West’s stack-sorting map.
  • A319034 (program): Decimal expansion of the height that minimizes the total surface area of the four triangular faces of a square pyramid of unit volume.
  • A319054 (program): Maximum product of an aperiodic integer partition of n.
  • A319058 (program): Number of relatively prime aperiodic factorizations of n into factors > 1.
  • A319073 (program): Square array read by antidiagonals upwards: T(n,k) = k*sigma(n), n >= 1, k >= 1.
  • A319074 (program): a(n) is the sum of the first n nonnegative powers of the n-th prime.
  • A319075 (program): Square array T(n,k) read by antidiagonal upwards in which row n lists the n-th powers of primes, hence column k lists the powers of the k-th prime, n >= 0, k >= 1.
  • A319076 (program): Square array T(n,k) read by antidiagonal upwards in which column k lists the partial sums of the powers of the k-th prime, n >= 0, k >= 1.
  • A319078 (program): Expansion of phi(-q) * phi(q)^2 in powers of q where phi() is a Ramanujan theta function.
  • A319084 (program): Numbers k such that the denominator of the Bernoulli polynomial B_k(x) is the squarefree kernel of k+1.
  • A319085 (program): a(n) = Sum_{k=1..n} k^2*tau(k), where tau is A000005.
  • A319086 (program): a(n) = Sum_{k=1..n} k^2*sigma(k), where sigma is A000203.
  • A319087 (program): a(n) = Sum_{k=1..n} k^2*phi(k), where phi is the Euler totient function A000010.
  • A319088 (program): a(n) = Sum_{k=1..n} k^2*tau_3(k), where tau_3 is A007425.
  • A319089 (program): a(n) = tau(n)^3, where tau is A000005.
  • A319097 (program): One of the three successive approximations up to 7^n for 7-adic integer 6^(1/3). This is the 3 (mod 7) case (except for n = 0).
  • A319098 (program): One of the three successive approximations up to 7^n for 7-adic integer 6^(1/3). This is the 5 (mod 7) case (except for n = 0).
  • A319100 (program): Number of solutions to x^6 == 1 (mod n).
  • A319102 (program): Triangle read by rows: The k-th column has alternating blocks of k 1’s followed by k 0’s (see example).
  • A319104 (program): Expansion of e.g.f. Product_{k>=1} 1/(1 - x^(k^2))^(1/k^2).
  • A319105 (program): Expansion of e.g.f. Product_{k>=0} 1/(1 - x^(2^k))^(1/2^k).
  • A319108 (program): Expansion of Product_{k>=1} (1 - x^k)^(k-1).
  • A319116 (program): Signs of the Maclaurin coefficients of 1/(exp(x) + Pi/2).
  • A319117 (program): Sign of the n-th Maclaurin coefficient of 1/(exp(x) + exp(1)/2).
  • A319120 (program): T(n, k) = binomial(n - k - 1, k)*binomial(2*n - 2*k, n)/(n + 1), for n >= 1 and 0 <= k <= floor((n - 1)/2), triangle read by rows.
  • A319127 (program): Crossing number of the complete bipartite graph K_{6,n}.
  • A319128 (program): Interleave n*(3*n - 2), 3*n^2 + n - 1, n=0,0,1,1, … .
  • A319129 (program): Decimal expansion of (1 + sqrt(3) + sqrt(2*sqrt(3)))/2.
  • A319130 (program): Expansion of Product_{k>=1} 1/(1 - x^k)^(2^omega(k)), where omega(k) = number of distinct primes dividing k (A001221).
  • A319131 (program): a(n) = Sum_{d|n} Sum_{p|d, p prime} p.
  • A319132 (program): a(n) = Sum_{d|n} Sum_{j|d} mu(j)^2*j, where mu = Möbius function (A008683).
  • A319158 (program): Given an equilateral triangular grid with side n, containing n(n+1)/2 points, a(n) is the minimal number of points to be selected, such that any equilateral triangle of points will include at least one of the selection, if the triangle has the same orientation as the grid.
  • A319159 (program): Given an equilateral triangular grid with side n, containing n(n+1)/2 points, a(n) is the minimal number of points to be selected, such that any equilateral triangle of points will include at least one of the selection.
  • A319161 (program): Numbers whose prime multiplicities appear with relatively prime multiplicities.
  • A319170 (program): Triangular numbers of the form 2..21..1; n_times 2 followed with n_times 1; n >= 1.
  • A319172 (program): a(n) = 2*(a(n-1) + a(n-3)) - a(n-4), with a(0) = 1, a(1) = 2, a(2) = 5 and a(3) = 12.
  • A319187 (program): Number of pairwise coprime subsets of {1,…,n} of maximum cardinality (A036234).
  • A319194 (program): a(n) = Sum_{k=1..n} sigma(n,k).
  • A319196 (program): a(n) = 2^(n-1)*Fibonacci(n-3), n >= 0.
  • A319198 (program): Partial sums of the infinite self-similar tribonacci word, written in the form A080843.
  • A319199 (program): One of the three successive approximations up to 7^n for 7-adic integer 6^(1/3). This is the 6 (mod 7) case (except for n = 0).
  • A319200 (program): a(n) = -(A(n) - A(n-1)) where A(n) = A057597(n+1), for n >= 0.
  • A319201 (program): Expansion of f(t) = F^{[-1]}(t)/t, where F(x) = x/(1 - x^2 - x^3).
  • A319202 (program): a(n) is the A-sequence for the Riordan matrix R = (1/(1- x^2 - x^3), x/(1 - x^2 - x^3)) from A104578.
  • A319204 (program): Sequence used for the Boas-Buck type recurrence for Riordan triangle A319203.
  • A319210 (program): a(n) = phi(n^2 - 1)/2 where phi is A000010.
  • A319213 (program): a(n) = phi(n^3 - 1)/3 where phi is A000010.
  • A319234 (program): T(n, k) is the coefficient of x^k of the polynomial p(n) which is defined as the scalar part of P(n) = Q(x, 1, 1, 1) * P(n-1) for n > 0 and P(0) = Q(1, 0, 0, 0) where Q(a, b, c, d) is a quaternion, triangle read by rows.
  • A319237 (program): Positions of nonzero terms in A114592, the list of coefficients in the expansion of Product_{n > 1} (1 - 1/n^s).
  • A319238 (program): Positions of zeros in A114592, the list of coefficients in the expansion of Product_{n > 1} (1 - 1/n^s).
  • A319246 (program): Sum of prime indices of the n-th squarefree number.
  • A319258 (program): a(n) = 1 + 2*3 + 4 + 5*6 + 7 + 8*9 + 10 + 11*12 + … + (up to n).
  • A319273 (program): Signed sum over the prime multiplicities of n.
  • A319279 (program): Numbers that are congruent to {0, 3, 7, 10} mod 12.
  • A319280 (program): Numbers that are congruent to {0, 4, 7, 11} mod 12.
  • A319288 (program): a(n) is the smallest k such that A319284(n, k) >= A319284(n, j) for all 0 <= j <= n.
  • A319289 (program): The x coordinates of the shell enumeration of N X N where N = {0, 1, 2, …} (A319514).
  • A319290 (program): The y coordinates of the shell enumeration of N X N where N = {0, 1, 2, …}(A319514).
  • A319296 (program): a(n) = (Sum_{d|n} (sigma(d))) mod sigma(n).
  • A319297 (program): Digits of one of the three 7-adic integers 6^(1/3) that is related to A319097.
  • A319301 (program): Sum of GCDs of strict integer partitions of n.
  • A319305 (program): Digits of one of the three 7-adic integers 6^(1/3) that is related to A319098.
  • A319307 (program): Expansion of theta_4(q)^16 in powers of q = exp(Pi i t).
  • A319308 (program): Expansion of theta_4(q)^20 in powers of q = exp(Pi i t).
  • A319309 (program): Expansion of theta_4(q)^24 in powers of q = exp(Pi i t).
  • A319310 (program): Expansion of theta_4(q)^28 in powers of q = exp(Pi i t).
  • A319316 (program): Numbers k such that A090616(k) < A054861(k).
  • A319317 (program): Numbers k such that A090616(k) > A054861(k).
  • A319340 (program): Sum of Euler totient function and its Dirichlet inverse: a(n) = A000010(n) + A023900(n).
  • A319341 (program): a(n) = A000010(n) - A173557(n).
  • A319359 (program): Expansion of Product_{i>=1, j>=1, k>=1} (1 - x^(i*j*k)).
  • A319364 (program): Expansion of e.g.f. exp(x^3/3)/(1 - x).
  • A319365 (program): Expansion of e.g.f. exp(x^4/4)/(1 - x).
  • A319371 (program): Numbers k such that the characteristic polynomial of a wheel graph of k nodes has exactly one monomial with vanishing coefficient.
  • A319373 (program): a(n) = 1*2 - 3*4 + 5*6 - 7*8 + 9*10 - 11*12 + 13*14 - … + (up to n).
  • A319384 (program): a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=5, a(2)=9, a(3)=21, a(4)=29.
  • A319388 (program): Non-palindromic squares.
  • A319389 (program): Non-palindromic cubes.
  • A319390 (program): a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=2, a(2)=3, a(3)=6, a(4)=8.
  • A319392 (program): a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n,k)*k!*n^k.
  • A319395 (program): Number of partitions of n into exactly two positive Fibonacci numbers.
  • A319404 (program): a(n) is the period of the periodic k-sequence q_k=lcm(k+1,k+2,…,k+n)/(n*binomial(k+n,n)).
  • A319406 (program): Write n-th prime in binary, then increase each run of 0’s by one 0, and increase each run of 1’s by one 1. a(n) is the decimal equivalent of the result.
  • A319407 (program): a(n) = A175046(n)-n.
  • A319408 (program): a(n) = A319407(n)/2.
  • A319409 (program): a(n) = n - A318921(n).
  • A319410 (program): Twice A032741.
  • A319412 (program): Maximal runs-resistance of a binary vector of length n.
  • A319413 (program): Number of trailing zero entries in row n of triangle A319411.
  • A319423 (program): Indices of records in A175046.
  • A319430 (program): First differences of the tribonacci representation numbers (A003726 or A278038).
  • A319432 (program): The first differences (A129761) of the tribonacci representation numbers (A003714 or A014417) consists of runs of 1’s separated by the terms of the present sequence.
  • A319433 (program): Take Zeckendorf representation of n (A014417(n)), drop least significant bit, take inverse Zeckendorf representation.
  • A319434 (program): Take Golomb’s sequence A001462 and shorten all the runs by 1.
  • A319438 (program): a(n) = 1^2 - 3^4 + 5^6 - 7^8 + 9^10 - 11^12 + 13^14 - … + (up to n).
  • A319440 (program): Squares of non-palindromic number.
  • A319441 (program): Cubes of non-palindromic numbers.
  • A319443 (program): Number of distinct Eisenstein primes in the factorization of n.
  • A319444 (program): Total number of factors in a factorization of n into Eisenstein primes.
  • A319445 (program): Number of Eisenstein integers in a reduced system modulo n.
  • A319448 (program): Moebius function mu(n) defined for the Eisenstein integers.
  • A319451 (program): Numbers that are congruent to {0, 3, 6} mod 12; a(n) = 3*floor(4*n/3).
  • A319452 (program): Numbers that are congruent to {0, 3, 6, 10} mod 12.
  • A319455 (program): Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(2*k)))^2.
  • A319468 (program): Number of partitions of n into exactly two nonzero decimal palindromes.
  • A319497 (program): a(0)=0, a(3*n)=9*a(n), a(3*n+1)=9*a(n)+1, a(3*n+2)=9*a(n)+3.
  • A319512 (program): a(n) = 7*a(n-1) - 14*a(n-2) + 7*a(n-3), a(0) = 1, a(1) = 3, a(2) = 11.
  • A319516 (program): Number of integers x such that 1 <= x <= n and gcd(x,n) = gcd(x+2,n) = gcd(x+6,n) = gcd(x+8,n) = 1.
  • A319522 (program): Completely multiplicative with a(prime(2*k)) = prime(k) and a(prime(2*k-1)) = 1 for any k > 0 (where prime(k) denotes the k-th prime number).
  • A319525 (program): Completely multiplicative with a(prime(k)) = prime(2*k - 1) (where prime(k) denotes the k-th prime).
  • A319526 (program): Square array read by antidiagonals upwards: T(n,k) = sigma(n*k), n >= 1, k >= 1.
  • A319527 (program): a(n) = 7 * sigma(n).
  • A319528 (program): a(n) = 8 * sigma(n).
  • A319529 (program): Odd numbers that have middle divisors.
  • A319534 (program): Number of integers x such that 1 <= x <= n and gcd(x,n) = gcd(x+2,n) = gcd(x+6,n) = 1.
  • A319536 (program): Number of signed permutations of length n where numbers occur in consecutive order.
  • A319552 (program): Expansion of 1/theta_4(q)^3 in powers of q = exp(Pi i t).
  • A319553 (program): Expansion of 1/theta_4(q)^8 in powers of q = exp(Pi i t).
  • A319554 (program): Expansion of 1/theta_4(q)^12 in powers of q = exp(Pi i t).
  • A319555 (program): Digits of one of the three 7-adic integers 6^(1/3) that is related to A319199.
  • A319556 (program): a(n) gives the alternating sum of length n, starting at n: n - (n+1) + (n+2) - … + (-1)^(n+1) * (2n-1).
  • A319571 (program): The stripe enumeration of N X N where N = {0, 1, 2, …}, also called boustrophedonic Cantor enumeration. Terms are interleaved x and y coordinates.
  • A319572 (program): The x coordinates of the stripe enumeration of N X N where N = {0, 1, 2, …}.
  • A319573 (program): The y coordinates of the stripe enumeration of N X N where N = {0, 1, 2, …}.
  • A319575 (program): a(n) = (2/3)*n*(n^3 - 6*n^2 + 11*n - 3).
  • A319576 (program): a(n) = (4/15)*n*(n - 1)*(n^3 - 9*n^2 + 26*n - 9).
  • A319577 (program): a(n) = (4/45)*n*(n - 2)*(n - 1)*(n^3 - 12*n^2 + 47*n - 15).
  • A319578 (program): a(n) = (1/3)*(n+2)^2*(3*n+3)!/(n+2)!^3.
  • A319588 (program): First of three consecutive triangular numbers that add up to a perfect square.
  • A319597 (program): Number of conjugacy classes for a non-abelian group of order p^3, where p is prime: a(n) = p^2 + p - 1 where p = prime(n).
  • A319603 (program): a(n) = n^3 + reversal of digits of n^3.
  • A319610 (program): a(n) is the minimal number of successive OFF cells that appears in n-th generation of rule-30 1D cellular automaton started from a single ON cell.
  • A319611 (program): a(n) is the number of gaps in the n-th generation of the rule-30 1D cellular automaton started from a single ON.
  • A319613 (program): a(n) = prime(n) * prime(2n).
  • A319617 (program): Number of Integer solutions to w^2 + x^2 + y^2 + z^2 < n^2; number of lattice points inside a 4-sphere of radius n.
  • A319618 (program): Number of non-isomorphic weight-n antichains of multisets whose dual is a chain of multisets.
  • A319622 (program): Number of non-isomorphic connected weight-n antichains of distinct sets whose dual is also an antichain of (not necessarily distinct) sets.
  • A319625 (program): Number of non-isomorphic connected weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.
  • A319626 (program): Primorial deflation of n (numerator): Let f be the completely multiplicative function over the positive rational numbers defined by f(p) = A034386(p) for any prime number p; f constitutes a permutation of the positive rational numbers; let g be the inverse of f; for any n > 0, a(n) is the numerator of g(n).
  • A319627 (program): Primorial deflation of n (denominator): Let f be the completely multiplicative function over the positive rational numbers defined by f(p) = A034386(p) for any prime number p; f constitutes a permutation of the positive rational numbers; let g be the inverse of f; for any n > 0, a(n) is the denominator of g(n).
  • A319630 (program): Positive numbers that are not divisible by two consecutive prime numbers.
  • A319635 (program): Number of non-isomorphic weight-n antichains of distinct multisets whose dual is also an antichain of (not necessarily distinct) multisets.
  • A319636 (program): a(n) = Sum_{k=1..n} binomial(2*n - 3*k + 1, n - k)*k/(n - k + 1).
  • A319638 (program): Number of non-isomorphic weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.
  • A319642 (program): Number of non-isomorphic weight-n antichains of distinct multisets whose dual is a chain of (not necessarily distinct) multisets.
  • A319645 (program): Number of non-isomorphic weight-n antichains of distinct multisets whose dual is a chain of distinct multisets.
  • A319650 (program): a(n) = A073138(n) - n.
  • A319651 (program): Largest number having in its ternary representation the same number of 0’s, 1’s and 2’s as n.
  • A319654 (program): Write n in 6-ary, sort digits into increasing order.
  • A319658 (program): a(n) is the minimal number of successive ON cells that appears in n-th generation of rule-30 1D cellular automaton started from a single ON cell.
  • A319659 (program): 2-rank of the class group of imaginary quadratic field with discriminant -k, k = A003657(n).
  • A319660 (program): 2-rank of the class group of imaginary quadratic field with discriminant -k, k = A039957(n).
  • A319661 (program): 2-rank of the class group of imaginary quadratic field with discriminant -k, k = A191483(n).
  • A319663 (program): Irregular triangle read by rows: T(n,k) = 5^k mod 2^n, n >= 2, 0 <= k <= 2^(n-2) - 1.
  • A319664 (program): Irregular triangle read by rows: T(n,k) = (-3)^k mod 2^n, n >= 2, 0 <= k <= 2^(n-2) - 1.
  • A319665 (program): Irregular triangle read by rows: T(n,k) = log_5(4*k + 1) mod 2^n, n >= 2, 0 <= k <= 2^(n-2) - 1.
  • A319666 (program): Irregular triangle read by rows: T(n,k) = log_(-3)(4*k + 1) mod 2^n, n >= 2, 0 <= k <= 2^(n-2) - 1.
  • A319667 (program): Palindromes a(n) = (10^n + 1)*(10^(n+1) + 1).
  • A319674 (program): a(n) = 1 + 2 + 3 - 4 - 5 - 6 + 7 + 8 + 9 - 10 - 11 - 12 + … - (up to n).
  • A319675 (program): Sum of digits of prime(n) and digits of prime(n+1).
  • A319676 (program): Numerator of A047994(n)/n where A047994 is the unitary totient function.
  • A319677 (program): Denominator of A047994(n)/n where A047994 is the unitary totient function.
  • A319678 (program): Numbers with property that the first digit is the length of the number (written in base 10).
  • A319683 (program): Sum of A003415(d) over the proper divisors d of n, where A003415 is arithmetic derivative.
  • A319684 (program): Sum of A003415(d) over the divisors d of n, where A003415 is arithmetic derivative.
  • A319690 (program): Fully multiplicative with a(p^e) = (p mod 3)^e.
  • A319691 (program): a(n) = 1 if n is either 1 or divisible only by primes congruent to 1 mod 3, 0 otherwise.
  • A319693 (program): Filter sequence combining sopfr(d) from all proper divisors d of n, where sopfr(d) is A001414(d) = sum of primes dividing d with repetition.
  • A319697 (program): Sum of even squarefree divisors of n.
  • A319699 (program): a(n) = A001065(A252463(n)).
  • A319701 (program): Filter sequence for sequences that are constant for all odd terms >= 3.
  • A319702 (program): Filter sequence for sequences that are constant for all even terms >= 2.
  • A319703 (program): a(n) = A003415(A252463(n)).
  • A319710 (program): a(n) = 1 if n is divisible by the square of its smallest prime factor, 0 otherwise.
  • A319711 (program): Sum of A034968(d) over proper divisors d of n, where A034968 gives the sum of digits in factorial base.
  • A319712 (program): Sum of A034968(d) over divisors d of n, where A034968 gives the sum of digits in factorial base.
  • A319713 (program): Sum of A276150(d) over proper divisors d of n, where A276150 gives the sum of digits in primorial base.
  • A319715 (program): Sum of A276150(d) over divisors d of n, where A276150 gives the sum of digits in primorial base.
  • A319722 (program): Write n in 5-ary, sort digits into decreasing order.
  • A319723 (program): Write n in 6-ary, sort digits into decreasing order.
  • A319724 (program): Write n in 7-ary, sort digits into decreasing order.
  • A319743 (program): Row sums of A174158.
  • A319759 (program): Number of non-isomorphic intersecting multiset partitions of weight n with empty intersection.
  • A319762 (program): Number of non-isomorphic intersecting set multipartitions (multisets of sets) of weight n with empty intersection.
  • A319764 (program): Number of non-isomorphic intersecting set systems of weight n with empty intersection.
  • A319769 (program): Number of non-isomorphic intersecting set multipartitions (multisets of sets) of weight n whose dual is also an intersecting set multipartition.
  • A319773 (program): Number of non-isomorphic intersecting set systems of weight n whose dual is also an intersecting set system.
  • A319776 (program): Number of partitions of 2n in which any two distinct parts differ by at least n.
  • A319784 (program): Number of non-isomorphic intersecting T_0 set systems of weight n.
  • A319785 (program): a(n) = A073138(n) + A038573(n).
  • A319795 (program): a(n) = n^(n+1)/(n-1)^n for n>1, rounded to nearest integer.
  • A319796 (program): Even numbers that have middle divisors.
  • A319801 (program): Odd numbers without middle divisors.
  • A319802 (program): Even numbers without middle divisors.
  • A319803 (program): a(n) = A319651(n) + A038574(n).
  • A319806 (program): a(n) = A319723(n) + A319654(n).
  • A319812 (program): Square array read by antidiagonals: T(n,k) = (1 + i)-adic valuation of n + k*i, n >= 0, k >= 0, or -1 if n + k*i = 0.
  • A319813 (program): a(n) is the smallest a such that n is divisible by a^n + 1, or 0 if no such a exists.
  • A319840 (program): Table read by antidiagonals: T(n, k) is the number of elements on the perimeter of an n X k matrix.
  • A319842 (program): a(n) = 8 * A104720(n) + ceiling(n/2).
  • A319852 (program): Difference between 3^n and the product of primes less than or equal to n.
  • A319857 (program): Difference between 4^n and the product of primes less than or equal to n.
  • A319861 (program): Triangle read by rows, 0 <= k <= n: T(n,k) is the numerator of the k-th Bernstein basis polynomial of degree n evaluated at the interval midpoint t = 1/2; denominator is A319862.
  • A319862 (program): Triangle read by rows, 0 <= k <= n: T(n,k) is the denominator of the k-th Bernstein basis polynomial of degree n evaluated at the interval midpoint t = 1/2; numerator is A319861.
  • A319866 (program): a(n) = 2*1 + 4*3 + 6*5 + 8*7 + 10*9 + 12*11 + … + (up to the n-th term).
  • A319879 (program): a(n) = minimal number m of unit squares needed to make an figure formed from squares (joined edge to edge) which has n holes.
  • A319880 (program): Difference between 2^n and the product of primes less than or equal to n.
  • A319885 (program): a(n) = 2*1 - 4*3 + 6*5 - 8*7 + 10*9 - 12*11 + 14*13 - 16*15 + … - (up to the n-th term).
  • A319895 (program): a(n) is the number of partitions of n into consecutive parts, plus the total number of parts in those partitions.
  • A319905 (program): Decimal expansion of 4*(sqrt(2) - 1)/3.
  • A319923 (program): Quasi-primes: composite numbers k such that the least prime factor is greater than k^(1/(log log k)^2).
  • A319924 (program): a(n) = A143565(2n,n) for n > 0, a(0) = 1.
  • A319927 (program): Numbers k such that the sum of the squares of the odd non-unitary divisors of k divides the sum of the squares of the non-unitary divisors of k.
  • A319929 (program): Minimal arithmetic table similar to multiplication with different rules for odd and even products, read by antidiagonals.
  • A319930 (program): a(n) = (1/24)*n*(n - 1)*(n - 3)*(n - 14).
  • A319931 (program): a(n) = -(1/120)*n*(n - 3)*(n - 6)*(n^2 - 21*n + 8).
  • A319932 (program): a(n) = (1/720)*n*(n - 10)*(n - 1)*(n^3 - 34*n^2 + 181*n - 144).
  • A319948 (program): a(n) = Product_{i=1..n} floor(3*i/2).
  • A319949 (program): a(n) = Product_{i=1..n} floor(4*i/3).
  • A319950 (program): a(n) = Product_{i=1..n} floor(5*i/3).
  • A319951 (program): Take Golomb’s sequence A001462 and extend all the runs by 1; prepend an initial 0.
  • A319952 (program): Let M = A022342(n) be the n-th number whose Zeckendorf representation is even; then a(n) = A129761(M).
  • A319953 (program): List of binary words of lengths 0, 1, 2, etc., including empty word, each prefixed by a 2.
  • A319956 (program): Image of 3 under repeated application of the morphism 1 -> 1, 2 -> 22, 3 -> 312.
  • A319966 (program): a(n) = A003144(A003146(n)).
  • A319967 (program): a(n) = A003145(A003144(n)) where A003144 and A003145 are positions of ‘1’ and ‘2’ in the tribonacci word A092782.
  • A319968 (program): a(n) = A003145(A003145(n)).
  • A319969 (program): a(n) = A003145(A003146(n)).
  • A319970 (program): a(n) = A003146(A003144(n)).
  • A319971 (program): a(n) = A003146(A003145(n)).
  • A319972 (program): a(n) = A003146(A003146(n)).
  • A319974 (program): Expansion of (1-x^3+x^4+x^6)/(b(2)*b(3)*b(4)) where b(n) = 1-x^n.
  • A319981 (program): a(n) is the number of integer partitions of n with largest part <= 3 for which the index of the seaweed algebra formed by the integer partition paired with its weight is 0.
  • A319984 (program): Fully multiplicative with a(p^e) = prime(p mod 4)^e.
  • A319986 (program): Fully multiplicative with a(p^e) = prime(p mod 6)^e.
  • A319988 (program): a(n) = 1 if n is divisible by the square of its largest prime factor, 0 otherwise.
  • A319993 (program): a(n) = A319997(n) / A173557(n).
  • A319995 (program): Number of divisors of n of the form 6*k + 5.
  • A319997 (program): a(n) = Sum_{d|n, d is odd} mu(n/d)*d, where mu(n) is Moebius function A008683.
  • A319998 (program): a(n) = Sum_{d|n, d is even} mu(n/d)*d, where mu(n) is Moebius function A008683.
  • A320003 (program): Number of proper divisors of n of the form 6*k + 3.
  • A320005 (program): Number of proper divisors of n of the form 6*k + 5.
  • A320006 (program): a(n) = 1 if n encodes a nonnegative combinatorial game (in a style of A106486), otherwise 0; Characteristic function of A126001.
  • A320007 (program): If there is k >= 0 such that floor(n/4^k) is odd and A320006(k) is 1, then a(n) = 1, otherwise a(n) = 0.
  • A320008 (program): a(0) = 1; for n > 0, a(n) = A000120(n) * a(n-A000120(n)), where A000120(n) is the binary weight of n.
  • A320009 (program): a(0) = 1; for n > 0, a(n) = A000005(n) * a(n-A000005(n)), where A000005(n) gives the number of divisors of n.
  • A320014 (program): Filter sequence combining the binary expansions of proper divisors of n, grouped by their residue classes mod 3.
  • A320015 (program): Number of proper divisors of n that are either of the form 6*k+1 or 6*k + 5.
  • A320016 (program): a(1) = a(2) = 1; for n > 2, a(n) = A000005(n) * a(A000005(n)), where A000005(n) gives the number of divisors of n.
  • A320029 (program): Decimal expansion of sqrt(9 + sqrt(9 + sqrt(9 + sqrt(9 + …)))) = (sqrt(37) + 1)/2.
  • A320031 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of the e.g.f. exp(x)/(1 - k*x).
  • A320032 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of the e.g.f. exp(-x)/(1 - k*x).
  • A320037 (program): Write n in binary, then modify each run of 0’s by appending one 1, and modify each run of 1’s by appending one 0. a(n) is the decimal equivalent of the result.
  • A320038 (program): Write n in binary, then modify each run of 0’s by prepending one 1, and modify each run of 1’s by prepending one 0. a(n) is the decimal equivalent of the result.
  • A320039 (program): Write n in binary, then modify each run of 0’s and each run of 1’s by appending a 1. a(n) is the decimal equivalent of the result.
  • A320040 (program): Consider the Cantor matrix of rational numbers. This sequence reads the numerator, then the denominator as one moves through the matrix along alternate up and down antidiagonals.
  • A320042 (program): a(n) = a(floor(n/2)) + (-1)^(n*(n+1)/2) with a(1)=0.
  • A320043 (program): Row sums of the triangle A322550.
  • A320047 (program): Consider coefficients U(m,l,k) defined by the identity Sum_{k=1..l} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,l,k) * T^k that holds for all positive integers l,m,T. This sequence gives 2-column table read by rows, where n-th row lists coefficients U(1,n,k) for k = 0, 1 and n >= 1.
  • A320048 (program): One half of composite numbers k with the property that the symmetric representation of sigma(k) has two parts.
  • A320049 (program): Expansion of (psi(x) / phi(x))^6 in powers of x where phi(), psi() are Ramanujan theta functions.
  • A320050 (program): Expansion of (psi(x) / phi(x))^7 in powers of x where phi(), psi() are Ramanujan theta functions.
  • A320052 (program): Number of product-sum knapsack partitions of n. Number of integer partitions y of n such that every product of sums of the parts of a multiset partition of any submultiset of y is distinct.
  • A320053 (program): Number of spanning sum-product knapsack partitions of n. Number of integer partitions y of n such that every sum of products of the parts of a multiset partition of y is distinct.
  • A320055 (program): Heinz numbers of sum-product knapsack partitions.
  • A320056 (program): Heinz numbers of product-sum knapsack partitions.
  • A320059 (program): Sum of divisors of n^2 that do not divide n.
  • A320062 (program): Nonprimes with odd digits only.
  • A320064 (program): The number of F_2 graphs on { 1, 2, …, n } with a unique cycle of weight 1, which corresponds to the number of reflectable bases of the root system of type D_n.
  • A320065 (program): a(n) is the smallest integer i such that binomial(2i,i) > n.
  • A320066 (program): Numbers k with the property that the symmetric representation of sigma(k) has five parts.
  • A320069 (program): Expansion of 1/(theta_3(q) * theta_3(q^2)), where theta_3() is the Jacobi theta function.
  • A320071 (program): Number of length n primitive (=aperiodic or period n) 6-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320072 (program): Number of length n primitive (=aperiodic or period n) 7-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320073 (program): Number of length n primitive (=aperiodic or period n) 8-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320074 (program): Number of length n primitive (=aperiodic or period n) 9-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320075 (program): Number of length n primitive (=aperiodic or period n) 10-ary words which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320085 (program): Triangle read by rows, 0 <= k <= n: T(n,k) is the numerator of the derivative of the k-th Bernstein basis polynomial of degree n evaluated at the interval midpoint t = 1/2; denominator is A320086.
  • A320087 (program): Number of primitive (=aperiodic) ternary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320088 (program): Number of primitive (=aperiodic) 4-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320089 (program): Number of primitive (=aperiodic) 5-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320090 (program): Number of primitive (=aperiodic) 6-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320091 (program): Number of primitive (=aperiodic) 7-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320092 (program): Number of primitive (=aperiodic) 8-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320093 (program): Number of primitive (=aperiodic) 9-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320094 (program): Number of primitive (=aperiodic) 10-ary words with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.
  • A320106 (program): Möbius transform of A320107.
  • A320107 (program): a(n) = A001227(A252463(n)).
  • A320110 (program): Restricted growth sequence transform of function f: f(1) = 0, f(n) = A046523(A252463(n)) for n > 1.
  • A320111 (program): Number of divisors d of n that are not of the form 4k+2.
  • A320118 (program): a(1) = a(2) = 1; for n > 2, a(n) = A181819(n) * a(A181819(n)).
  • A320137 (program): Numbers that have only one middle divisor.
  • A320142 (program): Numbers that have exactly two middle divisors.
  • A320156 (program): Decimal expansion of the unique real root of x^3 - 3*x^2 + 8*x - 16 = 0, or equivalently, the unique positive root of x^4*(x + 5) - 4^4 = 0.
  • A320158 (program): Decimal expansion of real root of x^3 + 11x^2 + 27x - 27 = 0, x^2*(x + 5)^3 - 2^2*3^3 = 0.
  • A320222 (program): Number of unlabeled rooted trees with n nodes in which the non-leaf branches directly under any given node are all equal.
  • A320224 (program): a(1) = 1; a(n > 1) = Sum_{k = 1..n-1} Sum_{d|k, d < k} a(d).
  • A320225 (program): a(1) = 1; a(n > 1) = Sum_{k = 1…n} Sum_{d|k, d < k} a(d).
  • A320226 (program): Number of integer partitions of n whose non-1 parts are all equal.
  • A320235 (program): G.f.: Product_{k>=1, j>=1} (1 + x^(k*j))^2.
  • A320236 (program): G.f.: Product_{k>=1, j>=1} 1/(1 - x^(k*j))^2.
  • A320258 (program): a(n) = n! * [x^n] exp(x*exp(-n*x)).
  • A320259 (program): Terms that are on the y-axis of the square spiral built with 2*k, 2*k+1, 2*k+1 for k >= 0.
  • A320261 (program): Write n in binary, then modify each run of 0’s and each run of 1’s by prepending a 1. a(n) is the decimal equivalent of the result.
  • A320262 (program): Write n in binary, then modify each run of 0’s and each run of 1’s by appending a 0. a(n) is the decimal equivalent of the result.
  • A320263 (program): Write n in binary, then modify each run of 0’s and each run of 1’s by prepending a 0. a(n) is the decimal equivalent of the result.
  • A320268 (program): Number of unlabeled series-reduced rooted trees with n nodes where the non-leaf branches directly under any given node are all equal.
  • A320271 (program): Number of unlabeled semi-binary rooted trees with n nodes in which the non-leaf branches directly under any given node are all equal.
  • A320278 (program): a(n) is the number of positive integers 0 < i < n such that i + n is a square.
  • A320281 (program): Terms that are on the positive x-axis of the square spiral built with 2*k, 2*k+1, 2*k+1 for k >= 0.
  • A320283 (program): Lexicographical ordering of pure imaginary integers in the base (-1+i) numeral system.
  • A320287 (program): a(n) = n! * [x^n] Sum_{k>=0} exp(n^k*x)*x^k/k!.
  • A320298 (program): Differences between positions of 1’s in binary expansion of Pi.
  • A320299 (program): Lengths of runs of consecutive zeros in binary expansion of Pi.
  • A320300 (program): Positions of 0’s in binary expansion of Pi/4.
  • A320301 (program): Differences between positions of 0’s in binary expansion of Pi.
  • A320302 (program): Number of consecutive ones in binary expansion of Pi.
  • A320326 (program): a(n) = Sum_{i=0..n} binomial(2*i-1,i)*binomial(2*i,n-i).
  • A320327 (program): Triangle T(n,m) = C(2*n,m)*C(2*n-1,n), 0 <= m <= 2*n, n >= 0.
  • A320329 (program): Row sums of A174790.
  • A320342 (program): Maximum term in Cunningham chain of the first kind generated by the n-th prime.
  • A320344 (program): Expansion of e.g.f. log(1 + x)/(1 - log(1 + x))^2.
  • A320352 (program): Expansion of e.g.f. (exp(x) - 1)/(exp(x) - exp(2*x) + 1).
  • A320354 (program): Square array A(n,k), n >= 0, k >= 1, read by antidiagonals: A(n,k) = Product_{j=1..n} (k^j - 1).
  • A320366 (program): Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
  • A320389 (program): Product_i prime(i)^e(i), where e are the nonzero exponents in the prime factorization of n, sorted in increasing order.
  • A320390 (program): Prime signature of n (sorted in decreasing order), concatenated.
  • A320393 (program): First members of the Cunningham chains of the first kind whose length is a prime.
  • A320394 (program): Number of ones in binary expansion n^5.
  • A320410 (program): Continued fraction of a constant t with partial denominators {a(n), n>=0} such that the continued fraction of 4*t yields partial denominators {6*a(n), n>=0}.
  • A320427 (program): a(n) = floor(3*n/2) + ceiling(n/6) + 9.
  • A320429 (program): The length of the shortest prefix of the Thue-Morse word decomposable to not less than n palindromes.
  • A320431 (program): The number of tiles inside a regular n-gon created by lines that run from each of the vertices of the n edges orthogonal to these edges.
  • A320432 (program): Expansion of e.g.f. exp(3 * (1 - exp(x)) + x).
  • A320433 (program): Expansion of e.g.f. exp(4 * (1 - exp(x)) + x).
  • A320440 (program): Row sums of A225043.
  • A320448 (program): a(n) is the maximum number of distinct distances between n non-attacking rooks on an n X n chessboard.
  • A320453 (program): a(n) = (n^n + n*(-1)^n)/(n + 1).
  • A320465 (program): a(n) = 2^n - (2^(n-1) mod n), where “mod” is the nonnegative remainder operator.
  • A320468 (program): a(n) = a(n-1) + 20*a(n-2), n >= 2; a(0)=1, a(1)=41.
  • A320469 (program): a(n) = 3*a(n-1) + 10*a(n-2), n >= 2; a(0)=1, a(1)=1.
  • A320471 (program): a(n) = floor(sqrt(n)) mod ceiling(sqrt(n)).
  • A320508 (program): T(n,k) = binomial(n - k - 1, k), 0 <= k < n, and T(n,n) = (-1)^n, triangle read by rows.
  • A320511 (program): Numbers k with the property that the symmetric representation of sigma(k) has six parts.
  • A320519 (program): a(n) = 2*n^n*cos(n*arcsin(sqrt(4*n^2-1)/(2*n))) for n > 0 and a(0) = 2.
  • A320522 (program): Numbers k such that k^10 divides 10^k.
  • A320524 (program): Number of chiral pairs of a row of n colors using 6 or fewer colors.
  • A320531 (program): T(n,k) = n*k^(n - 1), k > 0, with T(n,0) = A063524(n), square array read by antidiagonals upwards.
  • A320534 (program): a(n) = ((1 + sqrt(4*n^2 + 1))^n + (1 - sqrt(4*n^2 + 1))^n)/2^n.
  • A320545 (program): Number of partitions of n into parts of exactly three sorts which are introduced in ascending order such that sorts of adjacent parts are different.
  • A320553 (program): Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most three elements and for at least one block c the smallest integer interval containing c has exactly three elements.
  • A320561 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(2*k+1) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A320563 (program): Expansion of Product_{k>=1} 1/(1 - x^k/(1 - x)^k)^k.
  • A320564 (program): Expansion of Product_{k>=1} (1 + x^k/(1 - x)^k)^k.
  • A320565 (program): a(n) = ((1 + sqrt(4*n^2 + 1))^n - (1 - sqrt(4*n^2 + 1))^n)/(2^n * sqrt(4*n^2 + 1)).
  • A320568 (program): a(n) = Sum_{k=1..n} (-1)^(n-k)*binomial(n,k)*sigma(k).
  • A320570 (program): a(n) = L_n(n), where L_n(x) is the Lucas polynomial.
  • A320576 (program): a(n) gives the number of configurations of non-attacking rooks up to symmetry on an n X n chessboard such that the number of distinct distances between the rooks is given by A319476(n).
  • A320577 (program): Number of isosceles triangles whose vertices are the vertices of a regular n-gon.
  • A320581 (program): a(n) is the number of closed factors of length n in the Fibonacci word.
  • A320584 (program): Numbers whose first digit is prime.
  • A320586 (program): Expansion of (1/(1 - x)) * Sum_{k>=1} k*x^k/(x^k + (1 - x)^k).
  • A320589 (program): Expansion of (1/(1 + x)) * Sum_{k>=1} k*x^k/(x^k + (1 + x)^k).
  • A320592 (program): Number of partitions of n with four parts in which no part occurs more than twice.
  • A320599 (program): Numbers k such that 4k + 1 and 8k + 1 are both primes.
  • A320601 (program): Exponents of powers of two having a digit zero in decimal.
  • A320603 (program): a(0) = 1; if n is odd, a(n) = Product_{i=0..n-1} a(i); if n is even, a(n) = Sum_{i=0..n-1} a(i).
  • A320604 (program): Chromatic number of the n-polygon diagonal intersection graph.
  • A320614 (program): Expansion of (1 + x^5) / ((1 - x^2) * (1 - x^3) * (1 - x^7)) in powers of x.
  • A320615 (program): Number of ordered set partitions of [n] where k = two is minimal such that for each block b the smallest integer interval containing b has at most k elements.
  • A320628 (program): Products of primes of nonprime index.
  • A320629 (program): Products of odd primes of nonprime index.
  • A320632 (program): Numbers k such that there exists a pair of factorizations of k into factors > 1 where no factor of one divides any factor of the other.
  • A320642 (program): Number of 1’s in the base-(-2) expansion of -n.
  • A320649 (program): Expansion of 1/(1 - Sum_{k>=1} k^2*x^k/(1 - x^k)).
  • A320650 (program): Expansion of 1/(1 - Sum_{k>=1} x^k/(1 - x^(2*k))).
  • A320651 (program): Expansion of 1/(1 - Sum_{k>=1} k*x^k/(1 + x^k)).
  • A320652 (program): Expansion of 1/(2 - Product_{k>=1} 1/(1 - k*x^k)).
  • A320654 (program): Expansion of 1/(2 - Product_{k>=1} (1 + x^k)/(1 - x^k)).
  • A320656 (program): Number of factorizations of n into squarefree semiprimes. Number of multiset partitions of the multiset of prime factors of n, into strict pairs.
  • A320661 (program): a(n) = 2^(n+3) - 6*n - 7.
  • A320667 (program): First differences of A066194.
  • A320674 (program): Positive integers m with binary expansion (b_1, …, b_k) (where k = A070939(m)) such that b_i = [m == 0 (mod prime(i))] for i = 1..k (where prime(i) denotes the i-th prime number and [] is an Iverson bracket).
  • A320687 (program): Sum of differences of the larger square and primes between two squares.
  • A320688 (program): Sum of the square excess A056892 of the primes between two squares.
  • A320689 (program): Number of partitions of n with up to two distinct kinds of 1.
  • A320690 (program): Number of partitions of n with up to three distinct kinds of 1.
  • A320691 (program): Number of partitions of n with up to four distinct kinds of 1.
  • A320698 (program): Numbers whose product of prime indices is a prime power (A246655).
  • A320701 (program): Indices of primes followed by a gap (distance to next larger prime) of 6.
  • A320702 (program): Indices of primes followed by a gap (distance to next larger prime) of 8.
  • A320703 (program): Indices of primes followed by a gap (distance to next larger prime) of 10.
  • A320704 (program): Indices of primes followed by a gap (distance to next larger prime) of 12.
  • A320705 (program): Indices of primes followed by a gap (distance to next larger prime) of 14.
  • A320706 (program): Indices of primes followed by a gap (distance to next larger prime) of 16.
  • A320707 (program): Indices of primes followed by a gap (distance to next larger prime) of 18.
  • A320708 (program): Indices of primes followed by a gap (distance to next larger prime) of 20.
  • A320709 (program): Indices of primes followed by a gap (distance to next larger prime) of 22.
  • A320710 (program): Indices of primes followed by a gap (distance to next larger prime) of 24.
  • A320711 (program): Indices of primes followed by a gap (distance to next larger prime) of 26.
  • A320712 (program): Indices of primes followed by a gap (distance to next larger prime) of 28.
  • A320713 (program): Indices of primes followed by a gap (distance to next larger prime) of 30.
  • A320714 (program): Indices of primes followed by a gap (distance to next larger prime) of 32.
  • A320715 (program): Indices of primes followed by a gap (distance to next larger prime) of 34.
  • A320716 (program): Indices of primes followed by a gap (distance to next larger prime) of 36.
  • A320717 (program): Indices of primes followed by a gap (distance to next larger prime) of 38.
  • A320718 (program): Indices of primes followed by a gap (distance to next larger prime) of 40.
  • A320719 (program): Indices of primes followed by a gap (distance to next larger prime) of 42.
  • A320730 (program): Integers k such that A086747(k) = 0, where A086747 is the Baum-Sweet sequence.
  • A320733 (program): Number of partitions of n with two sorts of part 1 which are introduced in ascending order.
  • A320752 (program): Primes of the form 5*n^2 - 5*n + 13.
  • A320753 (program): Number of partitions of n with seven kinds of 1.
  • A320754 (program): Number of partitions of n with eight kinds of 1.
  • A320755 (program): Number of partitions of n with nine kinds of 1.
  • A320756 (program): Number of partitions of n with ten kinds of 1.
  • A320758 (program): Number of ordered set partitions of [n] where the maximal block size equals two.
  • A320770 (program): a(n) = (-1)^floor(n/4) * 2^floor(n/2).
  • A320772 (program): Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.
  • A320773 (program): Numbers (excluding squares) whose square root has a continued fraction with a period < 3.
  • A320816 (program): Number of partitions of n with exactly three sorts of part 1 which are introduced in ascending order.
  • A320826 (program): Expansion of x*(1 - 4*x)^(3/2)/(3*x - 1)^2.
  • A320827 (program): G.f.: -sqrt(1 - 4*x)*(2*x - 1)/(3*x - 1).
  • A320829 (program): Continued fraction of the positive constant t in (1,2) such that the partial denominators form the Beatty sequence {floor((n+1)*t), n >= 0}.
  • A320840 (program): Smallest N such that A092391(k) >= n for all k >= N.
  • A320857 (program): a(n) = Pi(8,5)(n) + Pi(8,7)(n) - Pi(8,1)(n) - Pi(8,3)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.
  • A320858 (program): a(n) = A320857(prime(n)).
  • A320859 (program): Powers of 2 with initial digit 3.
  • A320860 (program): Powers of 2 with initial digit 4.
  • A320861 (program): Powers of 2 with initial digit 5.
  • A320862 (program): Powers of 2 with initial digit 6.
  • A320864 (program): Powers of 2 with initial digit 8.
  • A320866 (program): Primes such that p + digitsum(p, base 4) is again a prime.
  • A320877 (program): a(n) = 1 + Sum_{k=1..n} 2^prime(k).
  • A320889 (program): Number of set partitions of strict factorizations of n into factors > 1 such that all the blocks have the same product.
  • A320895 (program): a(n) = Sum_{k=1..n} k^3 * tau(k), where tau is A000005.
  • A320896 (program): a(n) = Sum_{k=1..n} k * tau(k)^2, where tau is A000005.
  • A320897 (program): a(n) = Sum_{k=1..n} k^2 * tau(k)^2, where tau is A000005.
  • A320898 (program): Expansion of e.g.f. exp(theta_3(x) - 1), where theta_3() is the Jacobi theta function.
  • A320899 (program): Expansion of e.g.f. exp(1/theta_4(x) - 1), where theta_4() is the Jacobi theta function.
  • A320900 (program): Expansion of Sum_{k>=1} x^k/(1 + x^k)^3.
  • A320901 (program): Expansion of Sum_{k>=1} x^k/(1 + x^k)^4.
  • A320903 (program): Row sums of A320902.
  • A320904 (program): T(n, k) = binomial(2*n + 1 - k, k)*hypergeom([1, 1, -k], [1, 2*(n - k + 1)], -1), triangle read by rows, T(n, k) for n >= 0 and 0 <= k <= n.
  • A320905 (program): T(n, k) = binomial(2*n - 1 - k, k - 1)*hypergeom([2, 2, 1-k], [1, 1 - 2*k + 2*n], -1), triangle read by rows, T(n, k) for n >= 1 and 1 <= k <= n.
  • A320906 (program): T(n, k) = binomial(2*n - k, k - 1)*hypergeom([2, 2, 1 - k], [1, 2*(1 - k + n)], -1), triangle read by rows, T(n,k) for n >= 0 and 0 <= k <= n.
  • A320907 (program): Row sums of A320906.
  • A320914 (program): One of the three successive approximations up to 13^n for 13-adic integer 5^(1/3). This is the 7 (mod 13) case (except for n = 0).
  • A320915 (program): One of the three successive approximations up to 13^n for 13-adic integer 5^(1/3). This is the 8 (mod 13) case (except for n = 0).
  • A320916 (program): Consider A010060 as a 2-adic number …100110010110, then a(n) is its approximation up to 2^n.
  • A320919 (program): Positive integers k such that binomial(k, 3) is divisible by 6.
  • A320926 (program): Concatenation of successive segments generated by the morphism {0 -> {0, 0, 1}, 1 -> {0}}, starting with 0.
  • A320927 (program): Concatenation of successive segments generated by the morphism {0 -> {0, 0, 1}, 1 -> {0,1,0}}, starting with 0.
  • A320928 (program): Positions of 0 in A320927.
  • A320929 (program): Positions of 1 in A320927.
  • A320933 (program): a(n) = 2^n - floor((n+3)/2).
  • A320934 (program): Number of chiral pairs of color patterns (set partitions) for a row of length n using 4 or fewer colors (subsets).
  • A320941 (program): Expansion of Sum_{k>=1} x^k*(1 + x^k)/(1 - x^k)^4.
  • A320942 (program): Expansion of Sum_{k>=1} (-1 + Product_{j>=1} (1 + x^(k*j))/(1 - x^(k*j))).
  • A320947 (program): a(n) is the number of dominoes, among all domino tilings of the 2 X n rectangle, sharing a length-2 side with the boundary of the rectangle.
  • A320956 (program): The exponential limit of sec + tan.
  • A320957 (program): a(n) = (1/6)*n!*[x^n] (2 + sec(3*x) + tan(3*x) + 3*sec(x) + 3*tan(x)).
  • A320958 (program): The exponential limit of arcsin (odd indices only).
  • A320959 (program): The exponential limit of arctanh (odd indices only).
  • A320962 (program): a(n) = (-1)^(n-1)*(n-1)!*Sum_{i=0..n} Stirling2(n, i) if n > 0 and 0 otherwise.
  • A320965 (program): Squares divisible by a single cube > 1.
  • A320985 (program): Complement of A092855.
  • A320986 (program): Fibonacci rabbit sequence number n coded in base four.
  • A320987 (program): Fibonacci rabbit sequence number n coded in base five.
  • A320988 (program): Fibonacci rabbit sequence number n coded in base six.
  • A320989 (program): Fibonacci rabbit sequence number n coded in base seven.
  • A320990 (program): Fibonacci rabbit sequence number n coded in base eight.
  • A320991 (program): Fibonacci rabbit sequence number n coded in base nine.
  • A320996 (program): Extremal values of Euler characteristics of polytopes.
  • A320997 (program): An absolute lower bound on the number of components in perfect systems of difference sets (PSDS).
  • A320999 (program): Related to the enumeration of pseudo-square convex polyominoes by semi-perimeter.
  • A321002 (program): a(0)=3; thereafter a(n) = 20*6^(n-1)-2^(n-1).
  • A321003 (program): a(n) = 2^n*(4*3^n-1).
  • A321013 (program): a(n) = how many of {6,7,8} divide n.
  • A321014 (program): Number of divisors of n which are greater than 3.
  • A321016 (program): Triangle read by rows: number of partitions of n into distinct and consecutive parts with largest part k (n >= 1, 1 <= k <= n)..
  • A321017 (program): a(n) = floor(pi(n)/2).
  • A321018 (program): a(n) = round(pi(n)/2).
  • A321019 (program): Coordination sequence for 3-D tiling (Cairo tiling) X Z, with respect to a 5-valent point.
  • A321020 (program): A hybrid of Kolakoski’s sequence A000002 and Golomb’s sequence A001462: if A001462(n) is odd replace it with 1, if even with 2.
  • A321025 (program): a(n) = sum of a(n-4) and a(n-5), with the lowest possible initial values that will generate a sequence where a(n) is always > a(n-1): 4, 5, 6, 7 and 8.
  • A321029 (program): Number of integers x such that 1 <= x <= n and gcd(x,n) = gcd(x+4,n) = gcd(x+6,n) = gcd(x+10,n) = gcd(x+12,n) = 1.
  • A321030 (program): Number of integers x such that 1 <= x <= n and gcd(x,n) = gcd(x+4,n) = gcd(x+6,n) = gcd(x+10,n) = gcd(x+12,n) = gcd(x+16,n) = 1.
  • A321032 (program): Number of words of length 3n such that all letters of the binary alphabet occur at least once and are introduced in ascending order and which can be built by repeatedly inserting triples into the initially empty word.
  • A321044 (program): Irregular table related to f[(a*x+b)/(c*x+d)]=c*x+d)^(2*n)*f[x], and f[x]=1/(x+1), f[x]=(a*x+b)/(c*x+d).
  • A321045 (program): a(n) is the value of the first entry in the matrix A^n where A = [{1,2,3}, {4,5,6}, {7,8,9}].
  • A321048 (program): Number of permutations of [n] with no fixed points where the maximal displacement of an element equals two.
  • A321069 (program): Greatest prime factor of n^3+2.
  • A321070 (program): Squares divisible by more than one cube > 1.
  • A321071 (program): Twice the Thue-Morse constant (A014571).
  • A321072 (program): One of the two successive approximations up to 11^n for 11-adic integer sqrt(3). Here the 5 (mod 11) case (except for n = 0).
  • A321073 (program): One of the two successive approximations up to 11^n for 11-adic integer sqrt(3). Here the 6 (mod 11) case (except for n = 0).
  • A321074 (program): Digits of one of the two 11-adic integers sqrt(3).
  • A321075 (program): Digits of one of the two 11-adic integers sqrt(3).
  • A321076 (program): One of the two successive approximations up to 11^n for 11-adic integer sqrt(5). Here the 4 (mod 11) case (except for n = 0).
  • A321077 (program): One of the two successive approximations up to 11^n for 11-adic integer sqrt(5). Here the 7 (mod 11) case (except for n = 0).
  • A321078 (program): Digits of one of the two 11-adic integers sqrt(5).
  • A321079 (program): Digits of one of the two 11-adic integers sqrt(5).
  • A321090 (program): Sequence {a(n), n>=0} satisfying the continued fraction relation: if z = [a(0) + 1; a(1) + 1, a(2) + 1, a(3) + 1, …, a(n) + 1, …], then 3*z = [a(0) + 9; a(1) + 11, a(2) + 11, a(3) + 11, …, a(n) + 11, …].
  • A321091 (program): Continued fraction expansion of the constant z that satisfies: CF(3*z, n) = CF(z, n) + 10, for n >= 0, where CF(z, n) denotes the n-th partial denominator in the continued fraction expansion of z.
  • A321093 (program): Continued fraction expansion of the constant z that satisfies: CF(4*z, n) = CF(z, n) + 21, for n >= 0, where CF(z, n) denotes the n-th partial denominator in the continued fraction expansion of z.
  • A321095 (program): Continued fraction expansion of the constant z that satisfies: CF(5*z, n) = CF(z, n) + 36, for n >= 0, where CF(z, n) denotes the n-th partial denominator in the continued fraction expansion of z.
  • A321097 (program): Continued fraction expansion of the constant z that satisfies: CF(6*z, n) = CF(z, n) + 55, for n >= 0, where CF(z, n) denotes the n-th partial denominator in the continued fraction expansion of z.
  • A321100 (program): Sequence {a(n), n>=0} satisfying the continued fraction relation: if z = [a(0) + 1; a(1) + 1, a(2) + 1, a(3) + 1, …, a(n) + 1, …], then 7*z = [a(0) + 9; a(1) + 11, a(2) + 11, a(3) + 11, …, a(n) + 11, …].
  • A321101 (program): Sequence generated by: a(3*n) = 0, a(3*n+2) = 3 - a(3*n+1), a(9*n+1) = 1, a(9*n+7) = 2, a(9*n+4) = 3 - a(3*n+1), for n >= 0.
  • A321102 (program): Sequence generated by: a(3*n) = 1, a(3*n+2) = 1 - a(3*n+1), a(9*n+1) = 1, a(9*n+7) = 0, a(9*n+4) = 1 - a(3*n+1), for n >= 0.
  • A321103 (program): Sequence generated by: a(3*n) = 1, a(3*n+2) = 2 - a(3*n+1), a(9*n+1) = 2, a(9*n+7) = 0, a(9*n+4) = 2 - a(3*n+1), for n >= 0.
  • A321104 (program): Sequence generated by: a(3*n) = 1, a(3*n+2) = 2 - a(3*n+1), a(9*n+1) = 0, a(9*n+7) = 2, a(9*n+4) = 2 - a(3*n+1), for n >= 0.
  • A321105 (program): One of the three successive approximations up to 13^n for 13-adic integer 5^(1/3). This is the 11 (mod 13) case (except for n = 0).
  • A321106 (program): Digits of one of the three 13-adic integers 5^(1/3) that is related to A320914.
  • A321107 (program): Digits of one of the three 13-adic integers 5^(1/3) that is related to A320915.
  • A321108 (program): Digits of one of the three 13-adic integers 5^(1/3) that is related to A321105.
  • A321119 (program): a(n) = ((1 - sqrt(3))^n + (1 + sqrt(3))^n)/2^floor((n - 1)/2); n-th row common denominator of A321118.
  • A321120 (program): Decimal expansion of (3 + sqrt(3))/12.
  • A321123 (program): a(n) = 2^n + 2*n^2 + 2*n + 1.
  • A321124 (program): a(n) = (4*n^3 - 6*n^2 + 14*n + 3)/3.
  • A321126 (program): T(n,k) = max(n + k - 1, n + 1, k + 1), square array read by antidiagonals (n >= 0, k >= 0).
  • A321129 (program): Numerator of Sum_{k=1..n} (k*sin((Pi*k)/3))/sqrt(3).
  • A321131 (program): Values of m (mod 25), where A317905(m) = 1. Values of m (mod 25) such that V(m) = 1, where V(m) indicates the constant convergence speed of the tetration base m.
  • A321133 (program): a(n) = 3*a(n-1) + 10*a(n-2), n >= 2; a(0)=-1, a(1)=23.
  • A321140 (program): a(n) = Sum_{d|n} sigma_3(d).
  • A321141 (program): a(n) = Sum_{d|n} sigma_n(d).
  • A321153 (program): Possible total numbers of pips when rolling two dice in backgammon.
  • A321162 (program): Maximum number of unbordered conjugates for a binary word of length n.
  • A321171 (program): a(n) is the total number of 1’s in binary that n shares with the positive integers less than n.
  • A321173 (program): a(n) = -2*a(n-1) + a(n-2) + a(n-3), a(0) = -1, a(1) = 3, a(2) = -9.
  • A321174 (program): a(n) = -2*a(n-1) + a(n-2) + a(n-3), a(0) = -1, a(1) = -4, a(2) = 5.
  • A321175 (program): a(n) = -a(n-1) + 2*a(n-2) + a(n-3), a(0) = -1, a(1) = -2, a(2) = 3.
  • A321176 (program): Number of integer partitions of n that are the vertex-degrees of some set system with no singletons.
  • A321177 (program): Heinz numbers of integer partitions that are the vertex-degrees of some set system with no singletons.
  • A321178 (program): One-half the sum of the first 2n + 1 primes.
  • A321180 (program): a(n) = 17*n^2 - 1.
  • A321184 (program): Number of integer partitions of n that are the vertex-degrees of some multiset of nonempty sets, none of which is a proper subset of any other, with no singletons.
  • A321185 (program): Number of integer partitions of n that are the vertex-degrees of some strict antichain of sets with no singletons.
  • A321189 (program): a(n) = n! * [x^n] 1 - 1/(n - 1/(exp(x) - 1)).
  • A321193 (program): Even numbers with no more than one odd prime factor, not counting multiplicity.
  • A321195 (program): Minimum number of monochromatic Schur triples over all 2-colorings of [n].
  • A321197 (program): a(n) gives the A-sequence for the Riordan matrix (1/(1 + x^2 - x^3), x/(1 + x^2 - x^3)) from A321196.
  • A321199 (program): Row sums of Riordan triangle A321198.
  • A321202 (program): Row sums of the irregular triangle A321201.
  • A321204 (program): Row sums of Riordan triangle A319203.
  • A321205 (program): Alternating row sums of Riordan triangle A319203.
  • A321207 (program): a(n) = (n*n!)^3.
  • A321212 (program): Numbers that are congruent to {2, 3} mod 16.
  • A321213 (program): a(n) is the number of divisors of n-th Fermat number (A000215).
  • A321220 (program): a(n) = n+2 if n is even, otherwise a(n) = 2*n+1 if n is odd.
  • A321222 (program): a(n) = Sum_{d|n} mu(d)*d^n.
  • A321228 (program): Number of non-isomorphic hypertrees of weight n with singletons.
  • A321232 (program): Length of n-th term of A321225.
  • A321233 (program): a(n) is the number of reflectable bases of the root system of type D_n.
  • A321234 (program): Denominator of series expansion of the hypergeometric series 3F2([1/2, 1, 1], [3/2, 3/2], x).
  • A321236 (program): a(n) = Sum_{d|n} mu(d)^2*d^n.
  • A321237 (program): Start with a square of dimension 1 X 1, and repeatedly append along the squares of the previous step squares with half their side length that do not overlap with any prior square; a(n) gives the number of squares appended at n-th step.
  • A321243 (program): a(n) is the product of n and all its decimal digits individually except the leftmost digit.
  • A321257 (program): Start with an equilateral triangle, and repeatedly append along the triangles of the previous step equilateral triangles with half their side length that do not overlap with any prior triangle; a(n) gives the number of triangles appended at n-th step.
  • A321259 (program): a(n) = sigma_n(n) - n^n.
  • A321262 (program): Expansion of 1/(1 - Sum_{k>=1} k*x^(2*k)/(1 - x^k)).
  • A321294 (program): a(n) = Sum_{d|n} mu(n/d)*d*sigma_n(d).
  • A321295 (program): a(n) = n * sigma_n(n).
  • A321298 (program): Triangle read by rows: T(n,k) is the number of the k-th eliminated person in the Josephus elimination process for n people and a count of 2, 1 <= k <= n.
  • A321322 (program): a(n) = Sum_{d|n} mu(n/d)*J_2(d), where J_2() is the Jordan function (A007434).
  • A321324 (program): a(n) = (n^2 - c(n)) / 7 + 1 where c(n) = c(-n) = c(n+7) for all n in Z and a(n) = 1 if 0 <= n <=3 except a(1) = 0.
  • A321327 (program): Expansion of Product_{k>=0} (1 - x^(2^k))^(2^k).
  • A321330 (program): Denominators of a Boas-Buck sequence for the triangular Sheffer matrix S2[3,1] = A282629.
  • A321333 (program): Compound sequence with a(n) = A319198(A278040(n)), for n >= 0.
  • A321334 (program): n such that all n - s are squarefree numbers where s is a squarefree number in range n/2 <= s < n.
  • A321335 (program): Expansion of 1/(1 - x) * Product_{k>=0} 1/(1 - x^(2^k))^(2^(k+1)).
  • A321336 (program): Expansion of Product_{k>=0} (1 - x^(2^k))^(2^(k+1)).
  • A321341 (program): An unbounded sequence which is 1 infinitely often, with the property that for any four consecutive terms the maximum term is the sum of the two minimum terms.
  • A321346 (program): Number of integer partitions of n containing no prime powers > 1.
  • A321348 (program): a(n) = Sum_{d|n} tau(d^n), where tau() is the number of divisors (A000005).
  • A321349 (program): a(n) = Sum_{d|n} phi(d^n), where phi() is the Euler totient function (A000010).
  • A321358 (program): a(n) = (2*4^n + 7)/3.
  • A321366 (program): a(n) is the least integer k greater than 1 such that n divides binomial(k, 2) = A000217(k-1).
  • A321369 (program): Coefficients of successive polynomials formed by iterating f(x) = -1 + 2x^2. Irregular triangle read by rows.
  • A321370 (program): n + [n*s/r] + [n*t/r], where r = 1, s = cos(2*Pi/5), t = sec(2*Pi/5).
  • A321371 (program): n + [n*r/s] + [n*t/s], where r = 1, s = cos(2*Pi/5), t = sec(2*Pi/5).
  • A321372 (program): n + [n*r/t] + [n*s/t], where r = 1, s = cos(2*Pi/5), t = sec(2*Pi/5).
  • A321373 (program): Array T(n,k) read by antidiagonals where the first row is (-1)^k*A140966(k) and each subsequent row is obtained by adding A001045(k) to the preceding one.
  • A321378 (program): Number of integer partitions of n containing no 1’s or prime powers.
  • A321383 (program): Numbers k such that the concatenation k21 is a square.
  • A321384 (program): a(1) = 1; a(n+1) = -Sum_{d|n} d*a(d).
  • A321385 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^d.
  • A321386 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^(d-1).
  • A321387 (program): Expansion of Product_{k>=1} (1 + x^k)^(k^(k-1)).
  • A321388 (program): Expansion of Product_{k>=1} (1 + x^k)^(k^(k-2)).
  • A321391 (program): Array read by antidiagonals: T(n,k) is the number of achiral rows of n colors using up to k colors.
  • A321394 (program): a(n) = (1/24)*n!*[x^n] (9 + sectan(4*x) + 6*sectan(2*x) + 8*sectan(x)) where sectan(x) = sec(x) + tan(x).
  • A321398 (program): a(n) = (-1)^(n+1)*n!* x^n.
  • A321401 (program): Number of non-isomorphic strict self-dual multiset partitions of weight n.
  • A321402 (program): Number of non-isomorphic strict self-dual multiset partitions of weight n with no singletons.
  • A321403 (program): Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n.
  • A321404 (program): Number of non-isomorphic self-dual set multipartitions (multisets of sets) of weight n with no singletons.
  • A321405 (program): Number of non-isomorphic self-dual set systems of weight n.
  • A321406 (program): Number of non-isomorphic self-dual set systems of weight n with no singletons.
  • A321411 (program): Number of non-isomorphic self-dual multiset partitions of weight n with no singletons, with aperiodic parts whose sizes are relatively prime.
  • A321412 (program): Number of non-isomorphic self-dual multiset partitions of weight n with no singletons and with aperiodic parts.
  • A321416 (program): Number of n element multisets of the 10th roots of unity with zero sum.
  • A321421 (program): a(n) = 10*(4^n - 1)/3 + 1.
  • A321438 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^n.
  • A321461 (program): a(n) = -a(n-1) + 2*a(n-2) + a(n-3), a(0) = -1, a(1) = -2, a(2) = -4.
  • A321463 (program): Decimal expansion of 36*Pi.
  • A321480 (program): Zeroless analog of triangular numbers (version 2): a(0) = 0, and for any n > 0, a(n) = noz(1 + noz(2 + … + noz((n-1) + n))), where noz(n) = A004719(n) omits the zeros from n.
  • A321481 (program): Expansion of Sum_{n>=1} q^(n*(n-1)) / (1-q)^n.
  • A321483 (program): a(n) = 7*2^n + (-1)^n.
  • A321484 (program): Number of non-isomorphic self-dual connected multiset partitions of weight n.
  • A321490 (program): Triangular table T[n,k] = (n+k)(n^2+k^2), 1 <= k <= n = 1, 2, 3, …; read by rows.
  • A321499 (program): Numbers of the form (x - y)(x^2 - y^2) with x > y > 0.
  • A321500 (program): Triangular table T(n,k) = (n+k)*(n^2+k^2), n >= k >= 0; read by rows n = 0, 1, 2, …
  • A321501 (program): Numbers not of the form (x - y)(x^2 - y^2) with x > y > 0; complement of A321499.
  • A321510 (program): Primes p for which there exists a prime q < p such that 3*q == 1 (mod p).
  • A321512 (program): Characteristic function of the reverse in the shuffle (perfect faro shuffle with cut): 1 if the sequence of shuffles of n cards contains the reverse of the original order of cards, 0 if not.
  • A321516 (program): Number of composite divisors of n that are < n.
  • A321519 (program): Let d(n,i), i = 1..k be the k divisors of n^2 + 1 (the number 1 is not counted). a(n) is the number of ordered pairs d(n,i) < d(n,j) such that gcd(d(n,i), d(n,j)) = 1.
  • A321521 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d!.
  • A321522 (program): Expansion of Product_{k>=1} (1 + x^k)^((k-1)!).
  • A321526 (program): Number of partitioned graphs on n labeled nodes.
  • A321531 (program): a(n) is the maximum number of distinct directions between n non-attacking rooks on an n X n chessboard.
  • A321539 (program): 3^n with digits rearranged into nonincreasing order.
  • A321540 (program): 3^n with digits rearranged into nondecreasing order.
  • A321541 (program): a(0)=1; thereafter a(n) = 3*a(n-1) with digits rearranged into nonincreasing order.
  • A321542 (program): a(0)=1; thereafter a(n) = 3*a(n-1) with digits rearranged into nondecreasing order.
  • A321543 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^2.
  • A321544 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^5.
  • A321545 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^6.
  • A321546 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^7.
  • A321547 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^8.
  • A321548 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^9.
  • A321549 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^10.
  • A321550 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^11.
  • A321551 (program): a(n) = Sum_{d|n} (-1)^(d-1)*d^12.
  • A321552 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^7.
  • A321553 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^8.
  • A321554 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^9.
  • A321555 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^10.
  • A321556 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^11.
  • A321557 (program): a(n) = Sum_{d|n} (-1)^(n/d+1)*d^12.
  • A321558 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^2.
  • A321559 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^3.
  • A321560 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^4.
  • A321561 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^5.
  • A321562 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^6.
  • A321563 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^7.
  • A321564 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^8.
  • A321565 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^9.
  • A321573 (program): Row sums of A321624.
  • A321574 (program): Row sums of A321623.
  • A321577 (program): a(n) = F_n mod M_n, where F_n = 2^(2^n) + 1 and M_n = 2^n - 1.
  • A321578 (program): a(n) is the maximum value of k such that A007504(k) <= prime(n).
  • A321579 (program): Number of n-tuples of 4 elements excluding reverse duplicates and those consisting of repetitions of the same element only.
  • A321580 (program): Numbers k such that it is possible to reverse a deck of k cards by a sequence of perfect Faro shuffles with cut.
  • A321598 (program): a(n) = Sum_{d|n} d*binomial(d+2,3).
  • A321601 (program): G.f.: A(x,y) = Sum_{n=-oo…+oo} (x^n + y)^n = Sum_{n>=0} Sum_{k>=0} T(n,k) * x^(n^2 + n*k) * y^k, written here as a rectangle of coefficients T(n,k) read by antidiagonals.
  • A321613 (program): Partial products of the unitary totient function (A047994): a(n) = Product_{k=1..n} uphi(k).
  • A321622 (program): The Riordan square of the Fine numbers, triangle read by rows, T(n, k) for 0 <= k<= n.
  • A321628 (program): Row sums of A321627.
  • A321631 (program): Row sums of A321630.
  • A321632 (program): Expansion of e.g.f. (1 + sin(x))/exp(x).
  • A321643 (program): a(n) = 5*2^n - (-1)^n.
  • A321647 (program): Number of distinct row/column permutations of the Ferrers diagram of the integer partition with Heinz number n.
  • A321648 (program): Number of permutations of the conjugate of the integer partition with Heinz number n.
  • A321655 (program): Number of distinct row/column permutations of strict plane partitions of n.
  • A321663 (program): a(n) = prime(n)^prime(n+2).
  • A321664 (program): A sequence consisting of three disjoint copies of the Fibonacci sequence, one shifted, with the property that for any four consecutive terms the maximum term is the sum of the two minimum terms.
  • A321672 (program): Number of chiral pairs of rows of length 5 using up to n colors.
  • A321697 (program): T(j,k) = binomial(j^k,k)/j, j <= m, k <= j, written as triangle T(j,k).
  • A321702 (program): Numbers that are still valid after a horizontal reflection on a calculator display.
  • A321703 (program): a(n) = 3*a(n-1) + 4*a(n-2) + a(n-3), a(0) = 1, a(1) = 1, a(2) = 5.
  • A321715 (program): a(n) = 3*a(n-1) + 4*a(n-2) + a(n-3), a(0) = 1, a(1) = -1, a(2) = -1 .
  • A321728 (program): Number of integer partitions of n whose Young diagram cannot be partitioned into vertical sections of the same sizes as the parts of the original partition.
  • A321729 (program): Number of integer partitions of n whose Young diagram can be partitioned into vertical sections of the same sizes as the parts of the original partition.
  • A321740 (program): Number of representations of n as a truncated triangular number.
  • A321741 (program): Product of the first n terms of A007318 (Pascal), read as a sequence.
  • A321747 (program): Sum of coefficients of elementary symmetric functions in the monomial symmetric function of the integer partition with Heinz number n.
  • A321753 (program): Sum of coefficients of elementary symmetric functions in the power sum symmetric function indexed by the integer partition with Heinz number n.
  • A321764 (program): Sum of coefficients of Schur functions in the monomial symmetric function of the integer partition with Heinz number n.
  • A321773 (program): Number of compositions of n into parts with distinct multiplicities and with exactly three parts.
  • A321774 (program): Number of compositions of n into parts with distinct multiplicities and with exactly four parts.
  • A321789 (program): Factorials of terms of Pascal’s triangle by row.
  • A321798 (program): G.f. satisfies: A(x) = 1/(1 - x/(1 - x*A(x))^4).
  • A321799 (program): G.f. satisfies: A(x) = 1/(1 - x/(1 - x*A(x))^5).
  • A321807 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^10.
  • A321808 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^11.
  • A321809 (program): a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^12.
  • A321810 (program): Sum of 6th powers of odd divisors of n.
  • A321811 (program): Sum of 7th powers of odd divisors of n.
  • A321812 (program): Sum of 8th powers of odd divisors of n.
  • A321813 (program): Sum of 9th powers of odd divisors of n.
  • A321814 (program): Sum of 10th powers of odd divisors of n.
  • A321815 (program): Sum of 11th powers of odd divisors of n.
  • A321816 (program): Sum of 12th powers of odd divisors of n.
  • A321817 (program): a(n) = Sum_{d|n, n/d odd} d^6 for n > 0.
  • A321818 (program): a(n) = Sum_{d|n, n/d odd} d^8 for n > 0.
  • A321819 (program): a(n) = Sum_{d|n, n/d odd} d^10 for n > 0.
  • A321820 (program): a(n) = Sum_{d|n, n/d odd} d^12 for n > 0.
  • A321821 (program): a(n) = Sum_{d|n, d==1 mod 4} d^5 - Sum_{d|n, d==3 mod 4} d^5.
  • A321822 (program): a(n) = Sum_{d|n, d==1 mod 4} d^6 - Sum_{d|n, d==3 mod 4} d^6.
  • A321823 (program): a(n) = Sum_{d|n, d==1 mod 4} d^7 - Sum_{d|n, d==3 mod 4} d^7.
  • A321824 (program): a(n) = Sum_{d|n, d==1 mod 4} d^8 - Sum_{d|n, d==3 mod 4} d^8.
  • A321825 (program): a(n) = Sum_{d|n, d==1 (mod 4)} d^9 - Sum_{d|n, d==3 (mod 4)} d^9.
  • A321826 (program): a(n) = Sum_{d|n, d==1 mod 4} d^10 - Sum_{d|n, d==3 mod 4} d^10.
  • A321827 (program): a(n) = Sum_{d|n, d==1 (mod 4)} d^11 - Sum_{d|n, d==3 (mod 4)} d^11.
  • A321828 (program): a(n) = Sum_{d|n, d==1 mod 4} d^12 - Sum_{d|n, d==3 mod 4} d^12.
  • A321829 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^5 - Sum_{d|n, n/d==3 mod 4} d^5.
  • A321830 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^6 - Sum_{d|n, n/d==3 mod 4} d^6.
  • A321831 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^7 - Sum_{d|n, n/d==3 mod 4} d^7.
  • A321832 (program): a(n) = Sum_{d|n, n/d==1 (mod 4)} d^8 - Sum_{d|n, n/d==3 (mod 4)} d^8.
  • A321833 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^9 - Sum_{d|n, n/d==3 mod 4} d^9.
  • A321834 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^10 - Sum_{d|n, n/d==3 mod 4} d^10.
  • A321835 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^11 - Sum_{d|n, n/d==3 mod 4} d^11.
  • A321836 (program): a(n) = Sum_{d|n, n/d==1 mod 4} d^12 - Sum_{d|n, n/d==3 mod 4} d^12.
  • A321837 (program): Expansion of e.g.f.: exp(x/(1-3*x)).
  • A321838 (program): Number of words w of length n such that each letter of the binary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.
  • A321847 (program): E.g.f.: exp(x/(1 - 4*x)).
  • A321848 (program): E.g.f.: exp(x/(1-5*x)).
  • A321849 (program): Expansion of e.g.f.: exp(x/(1-6*x)).
  • A321850 (program): E.g.f.: exp(x/(1-7*x)).
  • A321853 (program): a(n) is the sum of the fill times of all 1-dimensional fountains given by the permutations in S_n.
  • A321858 (program): a(n) = Pi(12,5)(n) + Pi(12,7)(n) - Pi(12,1)(n) - Pi(12,11)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.
  • A321861 (program): a(n) = A071838(prime(n)).
  • A321862 (program): a(n) = A321857(prime(n)).
  • A321863 (program): a(n) = A321858(prime(n)).
  • A321875 (program): a(n) = Sum_{d|n} d*d!.
  • A321879 (program): Partial sums of the Jordan function J_2(k), for 1 <= k <= n.
  • A321882 (program): a(n) is the least base b > 1 such that the sum n + n can be computed without carry.
  • A321883 (program): Nonnegative integers n for which n! + 1 is not a square.
  • A321885 (program): a(1) = 1, a(n) = n + d(a(n-1)).
  • A321890 (program): Primes of the form p^2 + 16 where p is prime.
  • A321893 (program): Sum of coefficients of forgotten symmetric functions in the Schur function of the integer partition with Heinz number n.
  • A321898 (program): Sum of coefficients of power sums symmetric functions in h(y) * Product_i y_i! where h is homogeneous symmetric functions and y is the integer partition with Heinz number n.
  • A321901 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(-(2*k+1)) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A321902 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(1/(2*k+1)) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A321903 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(-1/(2*k+1)) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A321904 (program): Irregular table read by rows: T(n,k) is the smallest m such that m^(-m) == 2*k + 1 (mod 2^n), 0 <= k <= 2^(n-1) - 1.
  • A321905 (program): Irregular table read by rows: T(n,k) is the smallest m such that m^(1/m) == 2*k + 1 (mod 2^n), 0 <= k <= 2^(n-1) - 1.
  • A321906 (program): Irregular table read by rows: T(n,k) is the smallest m such that m^(-1/m) == 2*k + 1 (mod 2^n), 0 <= k <= 2^(n-1) - 1.
  • A321907 (program): If n > 1 is the k-th prime number, then a(n) = k!, otherwise a(n) = 0.
  • A321909 (program): a(n) is the least base b > 1 in which the additive persistence of n is <= 1.
  • A321942 (program): A sequence related to the Euler-Gompertz constant.
  • A321944 (program): Starting from n, repeatedly compute the sum of the prime divisors until a fixed point or 0 is reached; a(n) is the number of terms, including n.
  • A321946 (program): Number of divisors for the automorphism group size having the largest number of divisors for a binary self-dual code of length 2n.
  • A321957 (program): a(n) = binomial(3*n, n + 1)*hypergeom([1, 1 - 2*n], [2 + n], -1).
  • A321959 (program): a(n) = [x^n] ((1 - x)*x)/((1 - 2*x)^2*(2*x^2 - 2*x + 1)).
  • A321963 (program): Stieltjes generated from the sequence m, m+1, m+2, m+3, …. where m = 4.
  • A321965 (program): a(n) = n! [x^n] exp((1/(x - 1)^2 - 1)/2)/(1 - x).
  • A321968 (program): a(n) = 2^n*n!*[x^n] -sqrt(exp(LambertW(-x)))*(LambertW(-x) + 1).
  • A321973 (program): Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.
  • A321984 (program): Decimal expansion of number of kilograms (kg) in 1 international avoirdupois ounce (oz).
  • A321986 (program): Number of integer pairs (x,y) with x+y < 3*n/4, x-y < 3*n/4 and -x/2 < y < 2*x.
  • A321999 (program): Sum of digits of n minus the number of digits of n.
  • A322003 (program): Indices where A028897(A322000(n)) increases. Partial sums of A072170(n,10).
  • A322008 (program): 1/(1 - Integral_{x=0..1} x^(x^n) dx), rounded to the nearest integer.
  • A322014 (program): Heinz numbers of integer partitions with an even number of even parts.
  • A322015 (program): If A003188(n+1) < A003188(n), then a(n) = n+1, otherwise a(n) = 0.
  • A322016 (program): a(0) = 0; for n > 0, if A003188(n) > A003188(n-1) then a(n) = n-1, otherwise a(n) = 0.
  • A322018 (program): a(n) = A006068(A129760(A003188(n))).
  • A322026 (program): Lexicographically earliest such sequence a that a(i) = a(j) => A007814(i) = A007814(j) and A007949(i) = A007949(j), for all i, j, where A007814 and A007949 give the 2-adic and 3-adic valuation of n.
  • A322029 (program): Denominator of least value of the squared diameters of the enclosing circles of all strictly convex lattice n-gons with minimal area given by A070911. Numerators are A321693.
  • A322031 (program): (Sum_{t=0..oo} ((-1)^t*(2*t+1)*q^((2*t+1)^2)))^3 * (Sum_{t=0..oo} q^((2*t+1)^2)) = Sum_{k=0..oo} a(k)*q^(8*k+4).
  • A322034 (program): Let p1 <= p2 <= … <= pk be the prime factors of n, with repetition; let s = 1/p1 + 1/(p1*p2) + 1/(p1*p2*p3) + … + 1/(p1*p2*…*pk); a(n) = numerator of s. a(1)=0 by convention.
  • A322035 (program): Let p1 <= p2 <= … <= pk be the prime factors of n, with repetition; let s = 1/p1 + 1/(p1*p2) + 1/(p1*p2*p3) + … + 1/(p1*p2*…*pk); a(n) = denominator of s. a(1)=1 by convention.
  • A322036 (program): a(n) = A322035(n) - A322034(n).
  • A322037 (program): a(n) = 2^b(n), where b(n) = A000031(n).
  • A322039 (program): Expansion of (1 + x)^2 / ((1 - x)^2*(1 + 2*x)^2).
  • A322040 (program): Expansion of (1 + x)^2 / ((1 - x)^2*(1 + 2*x + 2*x^2)^2).
  • A322042 (program): Maximum edge-distance of a point in the quotient graph E/nE from the origin (see A322041 for further information).
  • A322043 (program): Numbers k such that the coefficient of x^k in the expansion of Product_{m >= 1} (1-x^m)^15 is zero.
  • A322048 (program): Final elements in rows when A322050 is displayed as a triangle.
  • A322051 (program): a(n) is the number of initial terms in the row of length 2^n of A322050 that agree with the limiting sequence A322049.
  • A322052 (program): Number of decimal strings of length n that contain a specific string xy where x and y are distinct digits.
  • A322053 (program): Number of decimal strings of length n that contain a specific string xx (where x is a single digit).
  • A322054 (program): Number of decimal strings of length n that do not contain a specific string xx (where x is a single digit).
  • A322062 (program): Sums of pairs of consecutive terms of Pascal’s triangle read by row.
  • A322068 (program): a(n) = (1/2)*Sum_{p prime <= n} floor(n/p) * floor(1 + n/p).
  • A322071 (program): Triangle read by rows: T(n, k) is the largest integer m such that m*k^k <= 2*n^k.
  • A322072 (program): Row sums of the triangle A322071.
  • A322075 (program): Number of factorizations of n into nonprime squarefree numbers > 1.
  • A322078 (program): a(n) = n^2 * Sum_{p|n} 1/p^2, where p are primes dividing n.
  • A322079 (program): a(n) = n^2 * Sum_{ p^k | n } k / p^2, where p are primes dividing n with multiplicity k.
  • A322085 (program): One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 4 (mod 13) case (except for n = 0).
  • A322086 (program): One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 9 (mod 13) case (except for n = 0).
  • A322087 (program): Digits of one of the two 13-adic integers sqrt(3).
  • A322088 (program): Digits of one of the two 13-adic integers sqrt(3).
  • A322089 (program): One of the two successive approximations up to 13^n for 13-adic integer sqrt(-3). Here the 6 (mod 13) case (except for n = 0).
  • A322090 (program): One of the two successive approximations up to 13^n for 13-adic integer sqrt(3). Here the 7 (mod 13) case (except for n = 0).
  • A322091 (program): Digits of one of the two 13-adic integers sqrt(-3).
  • A322092 (program): Digits of one of the two 13-adic integers sqrt(-3).
  • A322108 (program): Distance of n-th iteration in an alternating rectangular spiral.
  • A322111 (program): Number of non-isomorphic self-dual connected multiset partitions of weight n with multiset density -1.
  • A322112 (program): Number of non-isomorphic self-dual connected multiset partitions of weight n with no singletons and multiset density -1.
  • A322113 (program): Number of non-isomorphic self-dual connected antichains of multisets of weight n.
  • A322116 (program): Main diagonal of triangle A321600; a(n) = A321600(n,n-1) for n >= 1.
  • A322121 (program): Composite numbers m such that b^(m-1) == 1 (mod (b^2-1)*m) has a solution b.
  • A322127 (program): Triangular array, read by rows: T(n,k) = numerator of binomial(n-1, n-k)/k!, 1 <= k <= n.
  • A322128 (program): Triangular array, read by rows: T(n,k) = denominator of binomial(n-1, n-k)/k!, 1 <= k <= n.
  • A322129 (program): Digital roots of A057084.
  • A322135 (program): Table of truncated square pyramid numbers, read by antidiagonals.
  • A322136 (program): Numbers whose number of prime factors counted with multiplicity exceeds half their sum of prime indices by at least 1.
  • A322141 (program): a(n) is also the sum of the even-indexed terms of the n-th row of the triangle A237591.
  • A322144 (program): a(n) = Sum_{i=1..phi(n)-1} (r(i+1)-r(i))^2 where r(1) = 1 < … < n-1 = r(phi(n)) are the phi(n) integers relatively prime to n.
  • A322157 (program): The successive approximations up to 5^n for 5-adic integer 7^(1/5).
  • A322159 (program): Decimal expansion of 1 - 1/sqrt(5).
  • A322171 (program): Expansion of x*(3 + 5*x + x^2 + x^3)/((1 - x)^2*(1 + x^2)).
  • A322175 (program): Determinant of the symmetric n X n matrix M defined by M(i,j) = mu(gcd(i,j)) for 1 <= i,j <= n where mu is the Moebius function.
  • A322185 (program): a(n) = sigma(2*n) * binomial(2*n,n)/2, for n >= 1.
  • A322186 (program): G.f.: exp( Sum_{n>=1} A322185(n)*x^n/n ), where A322185(n) = sigma(2*n) * binomial(2*n,n)/2.
  • A322201 (program): Main diagonal of square table A322200.
  • A322202 (program): G.f.: exp( Sum_{n>=1} A322201(n)*x^n/n ), where A322201(n) is the coefficient of x^n*y^n/(2*n) in Sum_{n>=1} -log(1 - (x^n + y^n)).
  • A322203 (program): a(n) = coefficient of x^n*y^n/n in Sum_{n>=1} -log(1 - (x^n + y^n)), for n >= 1.
  • A322204 (program): G.f.: exp( Sum_{n>=1} A322203(n)*x^n/n ), where A322203(n) is the coefficient of x^n*y^n/n in Sum_{n>=1} -log(1 - (x^n + y^n)).
  • A322205 (program): a(n) = coefficient of x^(2*n)*y^n/n in Sum_{n>=1} -log(1 - (x^n + y^n)) for n >= 1.
  • A322206 (program): G.f.: exp( Sum_{n>=1} A322205(n)*x^n/n ), where A322205(n) is the coefficient of x^(2*n)*y^n/n in Sum_{n>=1} -log(1 - (x^n + y^n)).
  • A322216 (program): G.f.: Product_{n>=1} (1 - 2*x^n)^3.
  • A322217 (program): Expansion of the 2-adic integer sqrt(17) that ends in 01.
  • A322240 (program): a(n) = A084605(n)^2, the square of the central coefficient in (1 + x + 4*x^2)^n.
  • A322241 (program): G.f.: exp( Sum_{n>=1} A084605(n)^2 * x^n/n ), where A084605(n) is the central coefficient in (1 + x + 4*x^2)^n.
  • A322242 (program): G.f.: 1/sqrt(1 - 6*x - 7*x^2).
  • A322243 (program): a(n) = A322242(n)^2, the square of the central coefficient in (1 + 3*x + 4x^2)^n.
  • A322244 (program): G.f.: 1/sqrt(1 - 6*x - 55*x^2).
  • A322245 (program): a(n) = A322244(n)^2, the square of the central coefficient in (1 + 3*x + 16x^2)^n.
  • A322246 (program): Expansion of g.f.: 1/sqrt(1 - 10*x - 11*x^2).
  • A322247 (program): a(n) = A322246(n)^2, the square of the central coefficient in (1 + 5*x + 9*x^2)^n.
  • A322248 (program): G.f.: 1/sqrt( (1 + 3*x)*(1 - 13*x) ).
  • A322249 (program): a(n) = A322248(n)^2, the square of the central coefficient in (1 + 5*x + 16*x^2)^n.
  • A322250 (program): Take binary expansion of 2n-1 and delete the trailing block of 1’s, except if the number is 11…1, leave a single 1.
  • A322252 (program): a(0) = 1 and a(n) = (5*n)!/(5!*n!^5) for n > 0.
  • A322260 (program): Numbers k such that the poset of multiset partitions of a multiset whose multiplicities are the prime indices of k is a lattice.
  • A322264 (program): Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = denominator of Sum_{d|n} 1/d^k.
  • A322284 (program): Number of nonequivalent ways to place n nonattacking kings on a 2 X 2n chessboard under all symmetry operations of the rectangle.
  • A322303 (program): a(n) = Fibonacci(semiprime(n)).
  • A322306 (program): Number of connected divisors of n. Number of connected submultisets of the n-th multiset multisystem (A302242).
  • A322307 (program): Number of multisets in the swell of the n-th multiset multisystem.
  • A322309 (program): Largest automorphism group size for a binary self-dual code of length 2n
  • A322312 (program): a(n) = Product_{d|n, d+1 is prime} prime(1+A286561(n,d+1)), where A286561(n,k) gives the k-valuation of n (for k > 1).
  • A322321 (program): a(n) = lcm(A003557(n), A173557(n)).
  • A322325 (program): Number of nondecreasing Motzkin paths of length n.
  • A322327 (program): a(n) = A005361(n) * A034444(n).
  • A322328 (program): a(n) = A005361(n) * 4^A001221(n) for n > 0.
  • A322351 (program): a(n) = min(A003557(n), A173557(n)).
  • A322352 (program): a(n) = max(A003557(n), A173557(n)).
  • A322354 (program): Greatest common divisor of product p and product (p+2), where p ranges over distinct prime divisors of n; a(n) = gcd(A007947(n), A166590(A007947(n))).
  • A322359 (program): Least common multiple of product (p-1) and product (p+1), where p ranges over distinct prime divisors of n.
  • A322360 (program): Multiplicative with a(p^e) = p^2 - 1.
  • A322361 (program): a(n) = gcd(n, A003961(n)), where A003961 is completely multiplicative with a(prime(k)) = prime(k+1).
  • A322362 (program): a(n) = gcd(n, A166590(n)), where A166590 is completely multiplicative with a(p) = p+2 for prime p.
  • A322368 (program): Heinz numbers of disconnected integer partitions.
  • A322371 (program): a(n) is the least practical number that is divisible by prime(n).
  • A322372 (program): Least positive integer c such that c*prime(n) is practical.
  • A322373 (program): Let d_i be the i-th divisor of n. Then a(n) is the largest k such that gcd(d_k, …, d_tau(n)) = 1.
  • A322382 (program): a(n) = p*a(n/p) + 1, where p is the smallest prime divisor of n; a(1)=0.
  • A322405 (program): Number of compositions of n into parts 1, 8, 9.
  • A322406 (program): a(n) = n + n*n^n.
  • A322407 (program): Compound sequence a(n) = A319198(A278039(n)), for n >= 0.
  • A322408 (program): Compound sequence with a(n) = A319198(A278041(n)), for n >= 0.
  • A322409 (program): Compound tribonacci sequence with a(n) = A278040(A278040(n)), for n >= 0.
  • A322410 (program): Compound tribonacci sequence with a(n) = A278040(A278039(n)), for n >= 0.
  • A322411 (program): Compound tribonacci sequence with a(n) = A278040(A278041(n)), for n >= 0.
  • A322412 (program): Compound tribonacci sequence with a(n) = A278041(A278040(n)), for n >= 0.
  • A322413 (program): Compound tribonacci sequence with a(n) = A278041(A278039(n)), for n >= 0.
  • A322414 (program): Compound tribonacci sequence with a(n) = A278041(A278041(n)), for n >= 0.
  • A322417 (program): a(n) - 2*a(n-1) = period 2: repeat [3, 0] for n > 0, a(0)=5, a(1)=13.
  • A322420 (program): Sum of the first n*(n+1) primes.
  • A322430 (program): Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1-x^j)^8 is zero.
  • A322431 (program): Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1-x^j)^10 is zero.
  • A322432 (program): Numbers k such that the coefficient of x^k in the expansion of Product_{j>=1} (1-x^j)^14 is zero.
  • A322438 (program): Number of unordered pairs of factorizations of n into factors > 1 where no factor of one properly divides any factor of the other.
  • A322450 (program): Number of permutations of [2n] in which the size of the last cycle is n and the cycles are ordered by increasing smallest elements.
  • A322453 (program): Number of factorizations of n into factors > 1 using only primes and perfect powers.
  • A322458 (program): Sum of n-th powers of the roots of x^3 - 49*x + 49.
  • A322459 (program): Sum of n-th powers of the roots of x^3 + 7*x^2 + 14*x + 7.
  • A322462 (program): Numbers on the 0-1-12 line in a spiral on a grid of equilateral triangles.
  • A322465 (program): Numbers on the 0-9-10-line in a spiral on an equilateral triangular lattice.
  • A322483 (program): The number of semi-unitary divisors of n.
  • A322489 (program): Numbers k such that k^k ends with 4.
  • A322490 (program): Numbers k such that k^k ends with 7.
  • A322492 (program): Records in the number of ways to represent a number as truncated triangular number A008912.
  • A322496 (program): Number of tilings of a 3 X n rectangle using V (2m+1)-ominoes (m >= 0) in standard orientation.
  • A322504 (program): a(n) = -4*a(n-1) - 3*a(n-2) + a(n-3), a(0) = 1, a(1) = -2, a(2) = 4.
  • A322518 (program): Binomial transform of the Apéry numbers (A005259).
  • A322519 (program): Inverse binomial transform of the Apéry numbers (A005259).
  • A322533 (program): Position of 1/3^n in the sequence of all numbers 1/2^m, 1/3^m, 2/3^m arranged in decreasing order.
  • A322534 (program): Position of 2/3^n in the sequence of all numbers 1/2^m, 1/3^m, 2/3^m arranged in decreasing order.
  • A322544 (program): a(n) is the reciprocal of the coefficient of x^n in the power series of the function defined by ((1+2x)*exp(x) + 3*exp(-x) - 4)/ (4x^2).
  • A322546 (program): Numbers k such that every integer partition of k contains a 1 or a prime power.
  • A322550 (program): Table read by ascending antidiagonals: T(n, k) is the minimum number of cubes necessary to fill a right square prism with base area n^2 and height k.
  • A322551 (program): Primes indexed by squarefree semiprimes.
  • A322553 (program): Odd numbers whose product of prime indices is a prime power.
  • A322556 (program): The number of eigenvectors with eigenvalue 1 summed over all linear operators on the vector space GF(2)^n.
  • A322558 (program): a(0)=1, a(1)=1; for n>1, a(n)=a(n-1)+a(n-2) if a(n-1) is less than or equal to n-1, otherwise a(n)=a(n-1)-(n-1).
  • A322559 (program): One of the two successive approximations up to 17^n for 17-adic integer sqrt(2). This is the 6 (mod 17) case (except for n = 0).
  • A322560 (program): One of the two successive approximations up to 17^n for 17-adic integer sqrt(2). This is the 11 (mod 17) case (except for n = 0).
  • A322561 (program): Digits of one of the two 17-adic integers sqrt(2) that is related to A322559.
  • A322562 (program): Digits of one of the two 17-adic integers sqrt(2) that is related to A322560.
  • A322563 (program): One of the two successive approximations up to 17^n for 17-adic integer sqrt(-2). This is the 7 (mod 17) case (except for n = 0).
  • A322564 (program): One of the two successive approximations up to 17^n for 17-adic integer sqrt(-2). This is the 10 (mod 17) case (except for n = 0).
  • A322565 (program): Digits of one of the two 17-adic integers sqrt(-2) that is related to A322563.
  • A322566 (program): Digits of one of the two 17-adic integers sqrt(-2) that is related to A322564.
  • A322573 (program): G.f. = g(f(x)), where f(x) = g.f. of Fibonacci sequence A000045 and g(x) = g.f. of Jacobsthal sequence A001045.
  • A322577 (program): a(n) = Sum_{d|n} psi(n/d) * phi(d).
  • A322581 (program): Sum of A003958 and its Dirichlet inverse: a(n) = A003958(n) + A097945(n).
  • A322582 (program): a(n) = n - A003958(n), where A003958 is fully multiplicative with a(p) = (p-1).
  • A322584 (program): Number of divisors of n that area product of primorial numbers (terms of A025487).
  • A322585 (program): a(n) = 1 if n is a product of primorial numbers (A002110), 0 otherwise.
  • A322586 (program): a(n) = 1 if n is a highly composite number (A002182), 0 otherwise.
  • A322590 (program): Lexicographically earliest such positive sequence a that a(i) = a(j) => A007947(i) = A007947(j) for all i, j.
  • A322593 (program): a(n) = 2^n + 2*n^2 + 1.
  • A322594 (program): a(n) = (4*n^3 + 12*n^2 - 4*n + 3)/3.
  • A322595 (program): a(n) = (n^3 + 9*n + 14*n + 9)/3.
  • A322596 (program): Square array read by descending antidiagonals (n >= 0, k >= 0): let b(n,k) = (n+k)!/((n+1)!*k!); then T(n,k) = b(n,k) if b(n,k) is an integer, and T(n,k) = floor(b(n,k)) + 1 otherwise.
  • A322597 (program): a(n) = (4*n^3 - 6*n^2 + 20*n + 3)/3.
  • A322598 (program): a(n) is the number of unlabeled rank-3 graded lattices with 3 coatoms and n atoms.
  • A322615 (program): Nearest integer to 4*Pi*n^2.
  • A322623 (program): E.g.f.: (1 + sinh(x)) / (1 - sinh(x)).
  • A322628 (program): Number of n-digit decimal numbers containing a fixed 2-digit integer with distinct digits as a substring.
  • A322630 (program): Arithmetic table similar to multiplication with different rules for odd and even products, read by antidiagonals. T(n,k) = (n*k + A319929(n,k))/2.
  • A322631 (program): a(n) = 2*binomial(7*n-1,2*n)/(7*n-1).
  • A322655 (program): Numerator of (Sum_{d|n} sigma(d)) / sigma(n).
  • A322656 (program): Denominator of (Sum_{d|n} sigma(d)) / sigma(n).
  • A322661 (program): Number of graphs with loops spanning n labeled vertices.
  • A322665 (program): Partial sums of A089451.
  • A322666 (program): a(n) is the smallest positive integer k such that there does not exist an m such that floor(m^2/10^n) = k.
  • A322667 (program): a(n) is the smallest positive integer k such that floor((k + 1)^2/10^n) - floor(k^2/10^n) = 2.
  • A322671 (program): a(n) = Sum_{d|n} (pod(d)/d), where pod(k) is the product of the divisors of k (A007955).
  • A322672 (program): a(n) = Product_{d|n} (pod(d)/d) where pod(k) is the product of the divisors of k (A007955).
  • A322673 (program): a(n) = numerator of Product_{d|n} (sigma(d)/d) where sigma(k) = the sum of the divisors of k (A000203).
  • A322675 (program): a(n) = n * (4*n + 3)^2.
  • A322677 (program): a(n) = 16 * n * (n+1) * (2*n+1)^2.
  • A322699 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is 1/2 * (-1 + Sum_{j=0..k} binomial(2*k,2*j)*(n+1)^(k-j)*n^j).
  • A322701 (program): The successive approximations up to 2^n for 2-adic integer 3^(1/3).
  • A322702 (program): a(n) is the product of primes p such that p+1 divides n.
  • A322707 (program): a(0)=0, a(1)=5 and a(n) = 22*a(n-1) - a(n-2) + 10 for n > 1.
  • A322708 (program): a(0)=0, a(1)=6 and a(n) = 26*a(n-1) - a(n-2) + 12 for n > 1.
  • A322709 (program): a(0)=0, a(1)=7 and a(n) = 30*a(n-1) - a(n-2) + 14 for n > 1.
  • A322744 (program): Array T(n,k) = (3*n*k - A319929(n,k))/2, n >= 1, k >= 1, read by antidiagonals.
  • A322745 (program): a(n) = n * (16*n^2+20*n+5)^2.
  • A322746 (program): a(n) = 1/2 * (-1 + Sum_{k=0..n} binomial(2*n,2*k)*(n+1)^(n-k)*n^k).
  • A322747 (program): a(n) = sqrt(1 + A322746(2*n)).
  • A322753 (program): Expansion of x*(1 + 2*x - 3*x^2 + 4*x^3) / (1 - x - x^2 + x^3 - x^4).
  • A322755 (program): Numerator of expected payoff in the “Guessing Card Colors” game with a 2n-card deck, using an optimal strategy.
  • A322756 (program): Denominator of expected payoff in the “Guessing Card Colors” game with a 2n-card deck, using an optimal strategy.
  • A322761 (program): Irregular triangle read by rows in which n-th row lists all partitions of n, in graded reverse lexicographic ordering, using a compressed notation.
  • A322780 (program): First differences of A237262.
  • A322783 (program): a(n) = 1 - n + (2^(n+2) - (-1)^n)/3.
  • A322790 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Sum_{j=0..k} binomial(2*k,2*j)*(n+1)^(k-j)*n^j.
  • A322796 (program): a(n) = Kronecker symbol (6/n).
  • A322798 (program): Number of compositions (ordered partitions) of n into hexagonal numbers (A000384).
  • A322801 (program): Number of compositions (ordered partitions) of n into centered pentagonal numbers (A005891).
  • A322802 (program): Number of compositions (ordered partitions) of n into centered hexagonal numbers (A003215).
  • A322809 (program): Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n) = -1 if n is an odd prime, and f(n) = floor(n/2) for all other numbers.
  • A322813 (program): a(n) = A001227(A122111(n)).
  • A322819 (program): a(n) = A000593(A122111(n)).
  • A322820 (program): a(n) = A052126(n) * A006530(A052126(n)).
  • A322821 (program): a(1) = 0; for n > 1, a(n) = A000265(A048675(n)).
  • A322825 (program): A variant of A322827.
  • A322827 (program): A permutation of A025487: Sequence of least representatives of distinct prime signatures obtained from the run lengths present in the binary expansion of n.
  • A322829 (program): a(n) = Jacobi (or Kronecker) symbol (n/21).
  • A322830 (program): a(n) = 32*n^3 + 48*n^2 + 18*n + 1.
  • A322832 (program): Values x + y, where the ordered pairs (x,y) are sorted first by maximal coordinate and then lexicographically.
  • A322836 (program): Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Chebyshev polynomial of the first kind T_{n}(x), evaluated at x=k.
  • A322839 (program): Numbers n with more prime factors (counted with multiplicity) than n+1.
  • A322840 (program): Positive integers n with fewer prime factors (counted with multiplicity) than n + 1.
  • A322844 (program): a(n) = (1/12)*n^2*(3*(1 + n^2) - 2*(2 + n^2)*(n mod 2)).
  • A322860 (program): If n is practical (in A005153), a(n) = 1, otherwise a(n) = 0.
  • A322865 (program): a(n) = A000265(A122111(n)).
  • A322867 (program): a(n) = A000120(A122111(n)).
  • A322869 (program): a(n) = A000120(A048675(n)).
  • A322885 (program): Number of 3-generated Abelian groups of order n.
  • A322888 (program): Chebyshev T-polynomials T_n(16).
  • A322889 (program): Chebyshev T-polynomials T_n(18).
  • A322890 (program): a(n) = value of Chebyshev T-polynomial T_n(20).
  • A322899 (program): a(n) = T_{2*n}(n+1) where T_{n}(x) is a Chebyshev polynomial of the first kind.
  • A322904 (program): a(n) = Sum_{k=0..n} binomial(2*n+1,2*k+1)*(n^2-1)^(n-k)*n^(2*k).
  • A322907 (program): Entry points for the 3-Fibonacci numbers A006190.
  • A322908 (program): The determinant of an n X n Toeplitz matrix M(n) whose first row consists of successive positive integer numbers 1, …, n and whose first column consists of 1, n + 1, …, 2*n - 1.
  • A322914 (program): a(0)=0; for n>0, a(n) is the number of rooted 4-regular maps on the torus having n vertices.
  • A322918 (program): a(n) is the number of rooted 6-regular maps with n vertices on the torus.
  • A322921 (program): From Goldbach’s conjecture: a(n) is the number of decompositions of 6n into a sum of two primes.
  • A322923 (program): Primes of the form 3*p + 4, where p is a prime.
  • A322924 (program): Sum of n-th Bell number and n-th Bell number written backwards.
  • A322925 (program): Expansion of x*(1 + 2*x + 10*x^2)/((1 - x^2)*(1 - 10*x^2)).
  • A322926 (program): The successive approximations up to 2^n for 2-adic integer 5^(1/3).
  • A322927 (program): Expansion of x*(1 + 5*x + 40*x^2)/((1 - x^2)*(1 - 10*x^2)).
  • A322931 (program): Digits of the 8-adic integer 3^(1/3).
  • A322932 (program): Digits of the 8-adic integer 5^(1/3).
  • A322933 (program): Digits of the 8-adic integer 7^(1/3).
  • A322934 (program): The successive approximations up to 2^n for 2-adic integer 7^(1/3).
  • A322938 (program): a(n) = binomial(2*n + 2, n + 2) - 1.
  • A322939 (program): a(n) = [x^n] (4*x^2 + x - 1)/(4*x^3 + 3*x^2 + 2*x - 1).
  • A322940 (program): a(n) = [x^n] (4*x^2 + x - 1)/(2*x^2 + 3*x - 1).
  • A322943 (program): a(n) = n! [x^n] -exp(-1/(3*(x - 1)^3) - 1/3)/(x - 1).
  • A322970 (program): Coefficient triangle of polynomials recursively defined by P(n,x) = (n+1)*(n+1)! + x*Sum_{k=1..n} k^2*n!/(n+1-k)!*P(n-k,x) with P(0,x) = 1.
  • A322975 (program): Number of divisors d of n such that d-2 is prime.
  • A322976 (program): Number of divisors d of n such that d+2 is prime.
  • A322977 (program): Number of even divisors d of n such that d-1 is prime.
  • A322978 (program): Number of even divisors d of 2n such that d-1 is prime.
  • A322979 (program): a(n) = Sum A009191(d) over the divisors d of n, where A009191(x) = gcd(x, A000005(x)), and A000005(x) gives the number of divisors of x.
  • A322980 (program): a(n) = 1 if n and d(n) are coprime, 0 otherwise. Here d(n) is the number of divisors of n, A000005.
  • A322981 (program): If n is the k-th prime power > 1, a(n) = k, otherwise a(n) = 0.
  • A322982 (program): If n is a noncomposite, then a(n) = 2*n - 1, otherwise a(n) = A032742(n), the largest proper divisor of n.
  • A322983 (program): Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = n.
  • A322984 (program): Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n.
  • A322987 (program): Number of iterations of A049820(x) = x - A000005(x) needed to reach a square, when starting from x = n.
  • A322993 (program): a(1) = 0; for n > 1, a(n) = A000265(A156552(n)).
  • A322996 (program): Number of iterations of A049820(x) = x - A000005(x) needed to reach an odd number or zero, when starting from x = n.
  • A322997 (program): Number of iterations of A049820(x) = x - A000005(x) needed to reach an odd number or zero, when starting from x = 2n.
  • A322999 (program): The successive approximations up to 2^n for 2-adic integer 9^(1/3).
  • A323000 (program): Digits of the 2-adic integer 3^(1/3).
  • A323011 (program): a(n) = A172103(n) - A172104(n).
  • A323012 (program): a(n) = (1/sqrt(n^2+1)) * T_{2*n+1}(sqrt(n^2+1)) where T_{n}(x) is a Chebyshev polynomial of the first kind.
  • A323014 (program): a(1) = 0; a(prime) = 1; otherwise a(n) = 1 + a(A181819(n)).
  • A323045 (program): Digits of the 2-adic integer 5^(1/3).
  • A323048 (program): Sums of no more than two 5-smooth numbers.
  • A323055 (program): Numbers with exactly two distinct exponents in their prime factorization, or two distinct parts in their prime signature.
  • A323066 (program): Numbers whose binary complement (A035327) is a square.
  • A323071 (program): a(n) = gcd(n, 1+A060681(n)).
  • A323072 (program): a(n) = n/A323071(n) = n/gcd(n, 1+A060681(n)).
  • A323075 (program): The fixed point reached when map x -> 1+(x-(largest divisor d < x)) is iterated, starting from x = n.
  • A323076 (program): Number of iterations of map x -> 1+(x-(largest divisor d < x)), starting from x=n, needed to reach a fixed point, which is always either a prime or 1.
  • A323077 (program): Number of iterations of map x -> (x - (largest divisor d < x)) needed to reach 1 or a prime, when starting at x = n.
  • A323095 (program): Digits of the 2-adic integer 7^(1/3).
  • A323096 (program): Digits of the 2-adic integer 9^(1/3).
  • A323099 (program): Number T(n,k) of colored set partitions of [n] where exactly k colors are used for the elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
  • A323100 (program): Square array read by ascending antidiagonals: T(p,q) is the number of bases e such that e^2 = -1 in Clifford algebra Cl(p,q)(R).
  • A323116 (program): Fixed point of the morphism 1->221, 2->2211.
  • A323117 (program): a(n) = T_{n}(n-1) where T_{n}(x) is a Chebyshev polynomial of the first kind.
  • A323118 (program): a(n) = U_{n}(n) where U_{n}(x) is a Chebyshev polynomial of the second kind.
  • A323129 (program): a(1) = 1, and for any n > 1, let p be the greatest prime factor of n, and e be its exponent, then a(n) = p^a(e).
  • A323139 (program): Integers that are not multiples of 6 and are the sum of two consecutive primes.
  • A323152 (program): a(n) = 1 if sigma(n) is divisible by all proper divisors of n, 0 otherwise.
  • A323153 (program): a(n) = 1 if n is either a prime or a perfect number, 0 otherwise.
  • A323158 (program): If n is a square, a(n) = 1-(n mod 2), otherwise a(n) = (n mod 2); a(n) = A049820(n) mod 2, where A049820(n) = n - number of divisors of n.
  • A323159 (program): Greatest common divisor of product (1+(p^e)) and product (1+p), where p ranges over prime factors of n, with e corresponding exponent; a(n) = gcd(A034448(n), A048250(n)).
  • A323160 (program): a(n) = gcd(n, A323159(n)) = gcd(n, A034448(n), A048250(n)).
  • A323161 (program): Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n<=3) = -n, f(n) = 0 if n-1 is an odd prime, and f(n) = floor((n-1)/2) for all other numbers.
  • A323162 (program): a(n) = 1 if both n and n-1 are composite, 0 otherwise.
  • A323164 (program): a(n) = A000720(A323075(n)).
  • A323166 (program): Greatest common divisor of Product (1+(p_i^e_i)) and n, when n = Product (p_i^e_i); a(n) = gcd(A034448(n), n).
  • A323167 (program): a(n) = A294898(A122111(n)).
  • A323170 (program): a(n) = 1 if (2*phi(n)) < n, 0 otherwise, where phi is Euler totient function (A000010).
  • A323171 (program): Numerator of the average of distinct prime factors of n (A008472(n)/A001221(n)).
  • A323173 (program): Sum of divisors computed for conjugated prime factorization: a(n) = A000203(A122111(n)).
  • A323174 (program): Deficiency computed for conjugated prime factorization: a(n) = A033879(A122111(n)).
  • A323178 (program): a(n) = 1 + 100*n^2 for n >= 0.
  • A323181 (program): a(n) = U_{2*n-1}(n)/(2*n) where U_{n}(x) is a Chebyshev polynomial of the second kind.
  • A323182 (program): Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) is Chebyshev polynomial of the second kind U_{n}(x), evaluated at x=k.
  • A323186 (program): a(0) = 0, a’(0) = 0, a’‘(0) = 1, a’‘(1) = -1, a(n) = a(n-1) + a’(n), a’(n) = a’(n-1) + a’‘(n), a’‘(n) = -a’‘(n-1) if a(n-2) = 0, or else a’‘(n-1).
  • A323191 (program): Expansion of (1 - x^5) / ((1 + x) * (1 + x^4)) in powers of x.
  • A323202 (program): Expansion of (1 - x) * (1 - x^3) / (1 - x^4) in powers of x.
  • A323208 (program): a(n) = hypergeometric([-n - 1, n + 2], [-n - 2], n).
  • A323209 (program): a(n) = hypergeometric([-n, n + 1], [-n - 1], n).
  • A323210 (program): a(n) = 9*J(n)^2 where J(n) are the Jacobsthal numbers A001045 with J(0) = 1.
  • A323211 (program): Level 1 of Pascal’s pyramid. T(n, k) triangle read by rows for n >= 0 and 0 <= k <= n.
  • A323217 (program): a(n) = hypergeometric([-n, n + 1], [-n - 1], n + 1).
  • A323218 (program): a(n) = (4*n^3 + 30*n^2 + 50*n)/3 + 1.
  • A323219 (program): a(n) = [x^n] (1 - 4*x)^(-n/2)*x/(1 - x).
  • A323220 (program): a(n) = n*(n + 5)*(n + 7)*(n + 10)/24 + 1.
  • A323221 (program): a(n) = n*(n + 5)*(n + 7)/6 + 1.
  • A323222 (program): A(n, k) = [x^k] (1 - 4*x)^(-n/2)*x/(1 - x), square array read by ascending antidiagonals with n >= 0 and k >= 0.
  • A323223 (program): a(n) = [x^n] x/((1 - x)*(1 - 4*x)^(5/2)).
  • A323224 (program): A(n, k) = [x^k] C^n*x/(1 - x) where C = 2/(1 + sqrt(1 - 4*x)), square array read by ascending antidiagonals with n >= 0 and k >= 0.
  • A323225 (program): a(n) = ((2^n*n + i*(1 - i)^n - i*(1 + i)^n))/4, where i is the imaginary unit.
  • A323227 (program): a(n) = [x^n] (-x^4 + 2*x^3 - x^2 + 2*x - 1)/((x - 1)^2*(2*x - 1)).
  • A323228 (program): a(n) = binomial(n + 4, n - 1) + 1.
  • A323229 (program): a(n) = binomial(2*n, n+1) + 1.
  • A323230 (program): a(n) = binomial(2*(n - 1), n - 1) + 1.
  • A323231 (program): A(n, k) = [x^k] (1/(1-x) + x/(1-x)^n), square array read by descending antidiagonals for n, k >= 0.
  • A323232 (program): a(n) = 2^n*J(n, 1/2) where J(n, x) are the Jacobsthal polynomials as defined in A322942.
  • A323239 (program): a(n) = 1 if n is odd and squarefree, otherwise a(n) = 0.
  • A323243 (program): a(1) = 0; for n > 1, a(n) = A000203(A156552(n)).
  • A323244 (program): a(1) = 0; and for n > 1, a(n) = A033879(A156552(n)).
  • A323247 (program): a(n) = A005187(A156552(n)).
  • A323248 (program): a(n) = A323247(n) - A323243(n).
  • A323254 (program): The determinant of an n X n Toeplitz matrix M(n) whose first row consists of successive positive integer numbers 2*n - 1, n - 1, …, 1 and whose first column consists of 2*n - 1, 2*n - 2, …, n.
  • A323274 (program): Ceiling(1/(e - 1/0! - 1/1! - 1/2! - … - 1/n!).
  • A323277 (program): G.f. = (x/6)*( 1/(1-12*x)^(3/2) - 1/(1-12*x) ).
  • A323280 (program): a(n) = Sum_{k=0..n} binomial(n,k) * k^(2*k).
  • A323290 (program): Numerator of the sum of inverse products of cycle sizes in all permutations of [n].
  • A323291 (program): Denominator of the sum of inverse products of cycle sizes in all permutations of [n].
  • A323294 (program): Number of 3-uniform hypergraphs spanning n labeled vertices where every two edges have two vertices in common.
  • A323295 (program): Number of ways to fill a matrix with the first n positive integers.
  • A323300 (program): Number of ways to fill a matrix with the parts of the integer partition with Heinz number n.
  • A323304 (program): Heinz numbers of integer partitions that cannot be arranged into a matrix with equal row-sums and equal column-sums.
  • A323305 (program): Number of divisors of the number of prime factors of n counted with multiplicity.
  • A323306 (program): Heinz numbers of integer partitions that can be arranged into a matrix with equal row-sums and equal column-sums.
  • A323308 (program): The number of exponential semiproper divisors of n.
  • A323309 (program): The sum of exponential semiproper divisors of n.
  • A323325 (program): Coefficients a(n) of x^n*y^n*z^n in function A = A(x,y,z) such that A = 1 + x*B*C, B = 1 + y*C*A, and C = 1 + z*A*B, for n >= 0.
  • A323332 (program): The Dedekind psi function values of the powerful numbers, A001615(A001694(n)).
  • A323333 (program): The Euler phi function values of the powerful numbers, A000010(A001694(n)).
  • A323339 (program): Numerator of the sum of inverse products of parts in all compositions of n.
  • A323340 (program): Denominator of the sum of inverse products of parts in all compositions of n.
  • A323346 (program): Square array read by ascending antidiagonals: T(p,q) is the number of bases e such that e^2 = 1 (including e = 1) in Clifford algebra Cl(p,q)(R).
  • A323350 (program): Nonprime numbers > 1 whose number of prime factors counted with multiplicity is a perfect square.
  • A323351 (program): Number of ways to fill a (not necessarily square) matrix with n zeros and ones.
  • A323363 (program): Dirichlet inverse of Dedekind’s psi, A001615.
  • A323364 (program): Sum of Dedekind’s psi, A001615, and its Dirichlet inverse, A323363.
  • A323385 (program): Expansion of AGM(1,1-16*x) (where AGM denotes the arithmetic-geometric mean).
  • A323397 (program): a(n) = (4^n + 15*n - 1)/9.
  • A323398 (program): Lexicographically first 3-free sequence on nonnegative integers not containing the Stanley sequence S(0,1), which is A005836.
  • A323399 (program): Sum of Jordan function J_2(n), A007434 and its Dirichlet inverse, A046970.
  • A323403 (program): Sum of sigma and its Dirichlet inverse: a(n) = A000203(n) + A046692(n).
  • A323406 (program): Greatest common divisor of Product (p_i^e_i)-1 and Product (p_i^e_i)+1, when n = Product (p_i^e_i): a(n) = gcd(A047994(n), A034448(n)).
  • A323407 (program): Dirichlet inverse of A047994, unitary phi.
  • A323409 (program): Greatest common divisor of Product (p_i^e_i)-1 and n, when n = Product (p_i^e_i); a(n) = gcd(n, A047994(n)).
  • A323410 (program): Unitary analog of cototient function A051953: a(n) = n - A047994(n).
  • A323413 (program): Infinitary analog of cototient function A051953: a(n) = n - A091732(n).
  • A323416 (program): a(n) = (n-1)! * (10^n - 1) / 9.
  • A323420 (program): Lexicographically earliest sequence of positive integers such that for any n > 0, a(n + a(n)) > a(n).
  • A323425 (program): Number of ways n people in a line can each choose two others both on the same side of them.
  • A323437 (program): Number of semistandard Young tableaux whose entries are the prime indices of n.
  • A323439 (program): Number of ways to fill a Young diagram with the prime indices of n such that all rows and columns are strictly increasing.
  • A323444 (program): Sum of exponents in prime-power factorization of Product_{k=0..n} binomial(n,k) (A001142).
  • A323462 (program): Smallest number that can be obtained from the “Choix de Bruxelles”, version 2 (A323460) operation applied to n.
  • A323466 (program): Number of terms in row n of A323465.
  • A323467 (program): Smallest number in row n of A323465.
  • A323495 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(-1) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A323505 (program): Mirror image of (denominators of) Bernoulli tree, A106831.
  • A323506 (program): a(n) = A323505(n) / A246660(n).
  • A323508 (program): a(n) = A323505(A156552(n)).
  • A323512 (program): a(n) = A079559(A156552(n)).
  • A323519 (program): a(n) is the number of ways to fill a square matrix with the multiset of prime factors of n, if the number of prime factors (counted with multiplicity) is a perfect square, and a(n) = 0 otherwise.
  • A323520 (program): Numbers of the form p^(k^2) where p is prime and k >= 0.
  • A323521 (program): Numbers whose number of prime factors counted with multiplicity (A001222) is not a perfect square.
  • A323526 (program): One and prime numbers whose prime index is a perfect square.
  • A323540 (program): a(n) = Product_{k=0..n} (k^2 + (n-k)^2).
  • A323541 (program): a(n) = Product_{k=0..n} (k^3 + (n-k)^3).
  • A323542 (program): a(n) = Product_{k=0..n} (k^4 + (n-k)^4).
  • A323543 (program): a(n) = Product_{k=0..n} (k^5 + (n-k)^5).
  • A323544 (program): a(n) = Product_{k=0..n} (k^6 + (n-k)^6).
  • A323545 (program): a(n) = Product_{k=0..n} (k^7 + (n-k)^7).
  • A323547 (program): n-th digit in the base-2 expansion of 1/n.
  • A323553 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(-1/3) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A323554 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(-1/5) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A323555 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(1/5) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A323556 (program): Irregular table read by rows: T(n,k) = (2*k+1)^(1/3) mod 2^n, 0 <= k <= 2^(n-1) - 1.
  • A323576 (program): Primes p such that 2 is a primitive root modulo p while 128 is not.
  • A323577 (program): Primes p such that 2 is a primitive root modulo p while 2048 is not.
  • A323583 (program): Number of ways to split an integer partition of n into consecutive subsequences.
  • A323590 (program): Primes p such that 2 is a primitive root modulo p while 8192 is not.
  • A323591 (program): n-th digit after the radix point in the base-3 expansion of 1/n.
  • A323592 (program): n-th digit in the base-4 expansion of 1/n.
  • A323599 (program): Dirichlet convolution of the identity function with omega.
  • A323600 (program): Dirichlet convolution of sigma with omega.
  • A323608 (program): The position function the fractalization of which yields A323607.
  • A323610 (program): List of 5-powerful numbers (for the definition of k-powerful see A323395).
  • A323613 (program): Antidiagonal sums of A323182.
  • A323614 (program): List of 7-powerful numbers (for the definition of k-powerful see A323395).
  • A323618 (program): Expansion of e.g.f. (1 + x)*log(1 + x)*(2 + log(1 + x))/2.
  • A323620 (program): Expansion of e.g.f. 2*sqrt(1 + x)*sinh(sqrt(5)*log(1 + x)/2)/sqrt(5).
  • A323622 (program): The first row of the order of square grid cells touched by a circle expanding from the middle of a cell.
  • A323623 (program): The second row of the order of square grid cells touched by a circle expanding from the middle of a cell.
  • A323629 (program): List of 6-powerful numbers (for the definition of k-powerful see A323395).
  • A323630 (program): Expansion of e.g.f. exp(log(1 - x)^2/2)/(1 - x). This is also the transform of the involution numbers given by the signless Stirling cycle numbers.
  • A323631 (program): Stirling transform of Pell numbers (A000129).
  • A323632 (program): Stirling transform of Jacobsthal numbers (A001045).
  • A323633 (program): Expansion of 1/Sum_{k>=0} x^(k^3).
  • A323634 (program): Expansion of Product_{k>=1} 1/(1 - k^(k-1)*x^k).
  • A323639 (program): a(n) = 3*(10^n - 4)/9.
  • A323641 (program): Triangle read by rows in which row n lists the first 2^n terms of A323642, n >= 1.
  • A323642 (program): Row n of triangle A323641 when n -> infinity.
  • A323643 (program): a(n) is the sum of the noncentral divisors of n.
  • A323644 (program): Numbers with 3 or 4 divisors.
  • A323648 (program): Numbers k such that the largest Dyck path of the symmetric representation of sigma(k) does not share any line segment with the largest Dyck path of the symmetric representation of sigma(k+1).
  • A323649 (program): Corner sequence of the cellular automaton of A323650.
  • A323650 (program): Flower garden sequence (see Comments for precise definition).
  • A323651 (program): Number of elements added at n-th stage to the toothpick structure of A323650.
  • A323663 (program): Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is Sum_{j=1..n} binomial(j*k, k).
  • A323665 (program): a(n) is the number of vertices in the binary tree the root of which is assigned the value n and built recursively by the rule: write node’s value as (2^c)*(2k+1); if c>0, create a left child with value c; if k>0, create a right child with value k.
  • A323669 (program): Decimal expansion of 15/(2*Pi^2) = 1/((4/5)*zeta(2)).
  • A323703 (program): Number of values of (X^3 + X) mod prime(n).
  • A323704 (program): Number of cubic residues (including 0) modulo the n-th prime.
  • A323715 (program): a(n) = Product_{k=0..n} (2^k + 3^k).
  • A323716 (program): a(n) = Product_{k=0..n} (3^k + 1).
  • A323723 (program): a(n) = (-2 - (-1)^n*(-2 + n) + n + 2*n^3)/4.
  • A323724 (program): a(n) = n*(2*(n - 2)*n + (-1)^n + 3)/4.
  • A323728 (program): a(n) is the smallest number k such that both k-2*n and k+2*n are squares.
  • A323735 (program): a(n) is the largest minimal distance of a binary LCD [n,2] code.
  • A323739 (program): a(n) is the number of residues modulo (4*primorial(n)) of the squares of primes greater than or equal to prime(n+1).
  • A323741 (program): a(n) = m-p where m = (2n+1)^2 and p is the largest prime < m.
  • A323756 (program): a(1) = 2; for n >= 2, if a(n-1) has not yet been assigned, then a(n-1) = 1 and a(2*n-1) = 2, otherwise a(2*n) = 3.
  • A323760 (program): Numerator of Product_{d|n} (pod(d)/tau(d)) where pod(k) = the product of the divisors of k and tau(k) = the number of the divisors of k.
  • A323761 (program): Denominator of Product_{d|n} (pod(d)/tau(d)) where pod(k) = the product of the divisors of k and tau(k) = the number of the divisors of k.
  • A323768 (program): a(n) = Sum_{k=0..floor(n/2)} binomial(n-k,k)^k.
  • A323769 (program): a(n) = Sum_{k=0..floor(n/2)} binomial(n-k,k)^n.
  • A323770 (program): Expansion of e.g.f. x*(2 - x)*exp(x/(1 - x))/(2*(1 - x)^2).
  • A323771 (program): Expansion of e.g.f. 2*exp(x/(2 - 2*x))*sinh(sqrt(5)*x/(2 - 2*x))/sqrt(5).
  • A323772 (program): Expansion of e.g.f. 1 - LambertW(-x/(1 - x))*(2 + LambertW(-x/(1 - x)))/2.
  • A323775 (program): a(n) = Sum_{k = 1…n} k^(2^(n - k)).
  • A323776 (program): a(n) = Sum_{k = 1…n} binomial(k + 2^(n - k) - 1, k - 1).
  • A323812 (program): a(n) = n*Fibonacci(n-2) + ((-1)^n + 1)/2.
  • A323824 (program): a(0) = 6; thereafter a(n) = 4*a(n-1) + 1.
  • A323833 (program): A Seidel matrix A(n,k) read by antidiagonals upwards.
  • A323834 (program): A Seidel matrix A(n,k) read by antidiagonals downwards.
  • A323842 (program): Number of n-node Stanley graphs without isolated nodes.
  • A323847 (program): a(n) = (n-1)*(n-2)*(n^2+9*n+12)/24.
  • A323868 (program): Number of matrices of size n whose entries cover an initial interval of positive integers.
  • A323885 (program): Sum of A001511 and its Dirichlet inverse.
  • A323901 (program): a(n) = A002487(A163511(n)).
  • A323902 (program): a(n) = A002487(A156552(n)).
  • A323903 (program): a(n) = A002487(A122111(n)).
  • A323907 (program): Lexicographically earliest positive sequence such that a(i) = a(j) => A004718(i) = A004718(j), for all i, j >= 0.
  • A323908 (program): Reversing binary representation of A004718, Per Nørgård’s “infinity sequence”.
  • A323915 (program): a(n) = A023900(A005940(1+n)).
  • A323921 (program): a(n) = (4^(valuation(n, 4) + 1) - 1) / 3.
  • A323950 (program): Number of ways to split an n-cycle into connected subgraphs, none having exactly two vertices.
  • A323951 (program): Number of ways to split an n-cycle into connected subgraphs, all having at least three vertices.
  • A323952 (program): Regular triangle read by rows where if k > 1 then T(n, k) is the number of connected subgraphs of an n-cycle with any number of vertices other than 2 through k - 1, n >= 1, 1 <= k <= n - 1. Otherwise T(n, 1) = n.
  • A323956 (program): Triangle read by rows: T(n, k) = 1 + n * (n - k) for 1 <= k <= n.
  • A323967 (program): Number of 3 X n integer matrices (m_{i,j}) such that m_{1,1}=0, m_{3,n}=2, and all rows, columns, and falling diagonals are (weakly) monotonic without jumps of 2.
  • A323976 (program): Records for the number of ‘Reverse and Add’ steps, needed for a Lychrel number to join the trajectory of a smaller Lychrel number (i.e., its seed).
  • A323988 (program): a(n) = 2^(n - 1) + binomial(n, floor(n/2))*(n + 1)/2.
  • A323989 (program): Partial alternating sums modulo 3 of the Kolakoski sequence A000002.
  • A324015 (program): Number of nonempty subsets of {1, …, n} containing no two cyclically successive elements.
  • A324023 (program): One of the two successive approximations up to 5^n for 5-adic integer sqrt(6). This is the 1 (mod 5) case (except for n = 0).
  • A324024 (program): One of the two successive approximations up to 5^n for 5-adic integer sqrt(6). This is the 4 (mod 5) case (except for n = 0).
  • A324025 (program): Digits of one of the two 5-adic integers sqrt(6) that is related to A324023.
  • A324026 (program): Digits of one of the two 5-adic integers sqrt(6) that is related to A324024.
  • A324027 (program): One of the two successive approximations up to 5^n for 5-adic integer sqrt(-6). This is the 2 (mod 5) case (except for n = 0).
  • A324028 (program): One of the two successive approximations up to 5^n for 5-adic integer sqrt(-6). This is the 3 (mod 5) case (except for n = 0).
  • A324029 (program): Digits of one of the two 5-adic integers sqrt(-6) that is related to A324027.
  • A324030 (program): Digits of one of the two 5-adic integers sqrt(-6) that is related to A324028.
  • A324036 (program): Modified reduced Collatz map fs acting on positive odd integers.
  • A324044 (program): a(n) = A003958(n) - A033879(n).
  • A324045 (program): a(n) = A000010(n) - A106316(n).
  • A324046 (program): a(n) = gcd(n, A106316(n)).
  • A324047 (program): a(n) = A000203(n) - A106316(n).
  • A324048 (program): a(n) = A000203(n) - A083254(n) = n + sigma(n) - 2*phi(n).
  • A324050 (program): Numbers satisfying Korselt’s criterion: squarefree numbers n such that for every prime divisor p of n, p-1 divides n-1.
  • A324052 (program): a(n) = A083254(A005940(1+n)).
  • A324054 (program): a(n) = A000203(A005940(1+n)).
  • A324055 (program): Deficiency of Doudna-sequence: a(n) = A033879(A005940(1+n)).
  • A324056 (program): a(n) = A000593(A005940(1+n)).
  • A324057 (program): a(n) = A106315(A005940(1+n)).
  • A324058 (program): a(n) = A324121(A005940(1+n)) = gcd(A324054(n), A005940(1+n)*A106737(n)).
  • A324074 (program): Total number of distorted ancestor-successor pairs in all defective (binary) heaps on n elements.
  • A324077 (program): One of the four successive approximations up to 13^n for 13-adic integer 3^(1/4).This is the 2 (mod 13) case (except for n = 0).
  • A324082 (program): One of the four successive approximations up to 13^n for 13-adic integer 3^(1/4).This is the 3 (mod 13) case (except for n = 0).
  • A324083 (program): One of the four successive approximations up to 13^n for 13-adic integer 3^(1/4).This is the 10 (mod 13) case (except for n = 0).
  • A324084 (program): One of the four successive approximations up to 13^n for 13-adic integer 3^(1/4).This is the 11 (mod 13) case (except for n = 0).
  • A324085 (program): Digits of one of the four 3-adic integers 3^(1/4) that is congruent to 2 mod 13.
  • A324086 (program): Digits of one of the four 3-adic integers 3^(1/4) that is congruent to 3 mod 13.
  • A324087 (program): Digits of one of the four 3-adic integers 3^(1/4) that is congruent to 10 mod 13.
  • A324101 (program): Numbers whose “unary-binary encoded prime factorization” (A156552) is not A000120-deficient.
  • A324103 (program): a(1) = 0; for n > 1, a(n) = A083254(A156552(n)).
  • A324104 (program): a(1) = 0; for n > 1, a(n) = A000010(A156552(n)).
  • A324105 (program): a(1) = 0; for n > 1, a(n) = A000005(A156552(n)).
  • A324116 (program): a(n) = A002487(1+A323247(n)) = A324288(A156552(n)).
  • A324117 (program): Number of odd divisors in A156552(n): a(1) = 0, for n > 1, a(n) = A001227(A156552(n)) = A000005(A322993(n)).
  • A324118 (program): Sum of odd divisors in A156552(n): a(1) = 0, for n > 1, a(n) = A000593(A156552(n)) = A000203(A322993(n)).
  • A324119 (program): a(n) = A001221(A156552(n)).
  • A324121 (program): a(n) = gcd(n*d(n), sigma(n)), where d(n) = number of divisors of n (A000005) and sigma(n) = sum of divisors of n (A000203).
  • A324122 (program): a(n) = sigma(n) - gcd(n*d(n), sigma(n)), where d(n) = number of divisors of n (A000005) and sigma(n) = sum of divisors of n (A000203).
  • A324127 (program): Partial sums of A175046.
  • A324128 (program): a(n) = 2*n*Fibonacci(n) + (-1)^n + 1.
  • A324129 (program): a(n) = n*Fibonacci(n) + ((-1)^n + 1)/2.
  • A324133 (program): Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 12 and t = 12.
  • A324140 (program): Define b(n) and c(n) by b(0)=0, b(1)=c(0)=c(1)=1; b(n)=c(n-1)*c(n-2), c(n) = (b(n-1)+c(n-1)*(b(n-2)+c(n-2)); sequence gives b(n).
  • A324141 (program): Define b(n) and c(n) by b(0)=0, b(1)=c(0)=c(1)=1; b(n)=c(n-1)*c(n-2), c(n) = (b(n-1)+c(n-1)*(b(n-2)+c(n-2)); sequence gives c(n).
  • A324143 (program): This sequence and A324142 are a pair of complementary sequences studied by Bode, Harborth, and Kimberling (2007).
  • A324151 (program): a(n) = (2/((n+1)*(n+2)))*multinomial(3*n;n,n,n).
  • A324152 (program): a(0)=1; for n>0, a(n) = (3/((n+1)*(n+2)*(n+3))) * multinomial(4*n;n,n,n,n).
  • A324153 (program): Digits of one of the four 13-adic integers 3^(1/4) that is congruent to 11 mod 13.
  • A324158 (program): Expansion of Sum_{k>=1} x^k / (1 - k * x^k)^k.
  • A324159 (program): Expansion of Sum_{k>=1} k * x^k / (1 - k * x^k)^k.
  • A324161 (program): Number of zerofree nonnegative integers <= n.
  • A324169 (program): Number of labeled graphs covering the vertex set {1,…,n} with no crossing edges.
  • A324172 (program): Number of subsets of {1,…,n} that cross their complement.
  • A324174 (program): Integers k such that 2*floor(sqrt(k)) divides k.
  • A324182 (program): a(n) = A083254(A163511(n)).
  • A324183 (program): a(n) = d(A163511(n)), where d(n) is A000005, the number of divisors of n.
  • A324184 (program): a(n) = sigma(A163511(n)).
  • A324185 (program): Deficiency of n permuted by A163511: a(n) = A033879(A163511(n)) = 2*A163511(n) - sigma(A163511(n)).
  • A324186 (program): Sum of odd divisors permuted by A163511: a(n) = A000593(A163511(n)).
  • A324187 (program): a(n) = A106315(A163511(n)).
  • A324188 (program): a(n) = A324121(A163511(n)).
  • A324189 (program): a(n) = A324122(A163511(n)).
  • A324198 (program): a(n) = gcd(n, A276086(n)).
  • A324225 (program): Total number T(n,k) of 1’s in falling diagonals with index k in all n X n permutation matrices; triangle T(n,k), n>=1, 1-n<=k<=n-1, read by rows.
  • A324245 (program): The modified Collatz map considered by Vaillant and Delarue.
  • A324265 (program): a(n) = 5*343^n.
  • A324266 (program): a(n) = 2*49^n.
  • A324267 (program): a(n) = 11*7^(5*n).
  • A324268 (program): a(n) = 31*11^(5*n).
  • A324269 (program): a(n) = 3*11^(2*n).
  • A324270 (program): a(n) = 13*7^(7*n).
  • A324272 (program): a(n) = 2*13^(2*n).
  • A324275 (program): Numbers k for which A324274(k) is 0, i.e., starting squares in A324274 that yield a path of infinite length.
  • A324285 (program): a(n) = A002487(A297168(n)).
  • A324286 (program): a(n) = A002487(A048675(n)).
  • A324287 (program): a(n) = A002487(A005187(n)).
  • A324288 (program): a(n) = A002487(1+A005187(n)).
  • A324289 (program): a(n) = A276086(A283477(n)).
  • A324290 (program): a(n) = 1 if for every prime divisor p of n, p-1 divides n-1, 0 otherwise; characteristic function of A087441.
  • A324293 (program): a(n) = A002487(sigma(n)).
  • A324294 (program): a(n) = A002487(1+sigma(n)).
  • A324306 (program): G.f.: Sum_{n>=0} (2^n + 1)^n * x^n / (1 + 2^n*x)^(n+1).
  • A324331 (program): a(n) = (n-1)^2 - phi(n)*sigma(n), where phi is A000010 and sigma is A000203.
  • A324335 (program): a(n) = A323363(A005940(1+n)), where A005940 is the Doudna sequence and A323363 is the Dirichlet inverse of Dedekind’s psi.
  • A324337 (program): a(n) = A002487(A006068(n)).
  • A324338 (program): a(n) = A002487(1+A006068(n)).
  • A324340 (program): a(n) = A046692(A005940(1+n)), where A005940 is the Doudna sequence and A046692 is the Dirichlet inverse of sigma function.
  • A324342 (program): If 2n = 2^e1 + … + 2^ek [e1 .. ek distinct], then a(n) is the minimal number of primorials (A002110) that add to A002110(e1) * … * A002110(ek).
  • A324348 (program): a(n) = A294898(A005940(1+n)), where A294898(k) = A005187(k) - A000203(k).
  • A324349 (program): a(n) = A324122(A005940(1+n)), where A005940 is the Doudna sequence and A324122(n) = sigma(n) - gcd(n*d(n), sigma(n)).
  • A324352 (program): Total number of occurrences of 2 in the (signed) displacement sets of all permutations of [n+2] divided by 2!.
  • A324353 (program): Total number of occurrences of 3 in the (signed) displacement sets of all permutations of [n+3] divided by 3!.
  • A324354 (program): Total number of occurrences of 4 in the (signed) displacement sets of all permutations of [n+4] divided by 4!.
  • A324355 (program): Total number of occurrences of 5 in the (signed) displacement sets of all permutations of [n+5] divided by 5!.
  • A324356 (program): Total number of occurrences of 6 in the (signed) displacement sets of all permutations of [n+6] divided by 6!.
  • A324357 (program): Total number of occurrences of 7 in the (signed) displacement sets of all permutations of [n+7] divided by 7!.
  • A324358 (program): Total number of occurrences of 8 in the (signed) displacement sets of all permutations of [n+8] divided by 8!.
  • A324359 (program): Total number of occurrences of 9 in the (signed) displacement sets of all permutations of [n+9] divided by 9!.
  • A324360 (program): Total number of occurrences of 10 in the (signed) displacement sets of all permutations of [n+10] divided by 10!.
  • A324361 (program): Total number of occurrences of n in the (signed) displacement sets of all permutations of [2n] divided by n!.
  • A324362 (program): Total number of occurrences of k in the (signed) displacement sets of all permutations of [n+k] divided by k!; square array A(n,k), n>=0, k>=0, read by antidiagonals.
  • A324368 (program): Number of partitions of n that contain {1,2} minus number of partitions of n that contain neither 1 nor 2.
  • A324377 (program): a(0) = 0; for n > 0, a(n) = A000265(A005187(n)).
  • A324378 (program): a(n) = A000265(1+A005187(n)).
  • A324379 (program): a(n) = A007814(A005187(n)).
  • A324383 (program): a(n) is the minimal number of primorials that add to A322827(n).
  • A324384 (program): a(n) = gcd(n, A276154(n)), where A276154 is the primorial base left shift.
  • A324386 (program): a(n) = A324383(A006068(n)).
  • A324388 (program): If n is a prime power (in A000961), then a(n) = n, otherwise a(n) is the greatest proper unitary divisor of n.
  • A324391 (program): Fully multiplicative with a(p^e) = A070939(p)^e, where A070939(p) gives the length of the binary representation of p.
  • A324394 (program): a(n) = A009194(A005940(1+n)), where A005940 is the Doudna sequence and A009194(n) = gcd(n,sigma(n)).
  • A324395 (program): a(n) = A017666(A005940(1+n)), where A005940 is the Doudna sequence and A017666(n) = n/gcd(n,sigma(n)).
  • A324396 (program): a(1) = 0; for n > 1, a(n) = A009194(A156552(n)).
  • A324398 (program): a(1) = 0; for n > 1, a(n) = A318458(A156552(n)).
  • A324400 (program): Lexicographically earliest sequence such that a(i) = a(j) => f(i) = f(j) for all i, j >= 1, where f(n) = -1 if n = 2^k and k > 0, and f(n) = n for all other numbers.
  • A324445 (program): Number of labeled cyclic chord diagrams with n chords such that the minimal chord length equals one.
  • A324465 (program): Exponent of highest power of 2 that divides A324152(n).
  • A324466 (program): Exponent of highest power of 2 that divides multinomial(3*n;n,n,n).
  • A324467 (program): Three times the binary weight of n: 3*A000120(n).
  • A324468 (program): a(n) = r(n) + r(n+1) + r(n+2), where r(n) is the ruler sequence A007814.
  • A324469 (program): Exponent of highest power of 3 that divides multinomial(4*n;n,n,n,n).
  • A324470 (program): Partial sums of ternary tribonacci word A092782.
  • A324471 (program): a(n) = 10 mod n.
  • A324472 (program): a(n) = 1000 mod n.
  • A324476 (program): Packing numbers for n-tripods.
  • A324478 (program): a(n) = (6/((n+1)*(n+2)*(n+3))) * multinomial(4*n;n,n,n,n).
  • A324482 (program): Symmetric inflation orbit counts (b-bar)_{2n} for 1D cut and project patterns with inversion symmetric tau-inflation.
  • A324483 (program): Expansion of (1-x-x^2)^2*(1+x-x^2)^2/((1-3*x+x^2)*(1-x)^2*(1+x)^4).
  • A324486 (program): G.f. = (1-3*x+x^2)^3*(1+3*x+x^2)^3*(1-x^2)^10/((1-4*x-x^2)*(1-x-x^2)^6*(1+x-x^2)^9).
  • A324487 (program): a(n) = A001350(n)^3.
  • A324490 (program): A324487(3*n).
  • A324493 (program): Expansion of (1-18*x+x^2)^3*(1+18*x+x^2)^3*(1-x^2)^10/((1-76*x-x^2)*(1-4*x-x^2)^6*(1+4*x-x^2)^9).
  • A324498 (program): Decimal expansion of the real solution to x^2*(x-1)^3 = 1.
  • A324502 (program): a(n) = denominator of Sum_{d|n} (1/pod(d)) where pod(k) = the product of the divisors of k (A007955).
  • A324506 (program): a(n) = numerator of Product_{d|n} (d/tau(d)) where tau(k) = the number of divisors of k (A000005).
  • A324507 (program): a(n) = denominator of Product_{d|n} (d/tau(d)) where tau(k) = the number of divisors of k (A000005).
  • A324509 (program): a(n) = numerator of Product_{d|n} (sigma(d)/tau(d)) where sigma(k) = the sum of the divisors of k (A000203) and tau(k) = the number of divisors of k (A000005).
  • A324510 (program): a(n) = denominator of Product_{d|n} (sigma(d)/tau(d)) where sigma(k) = the sum of the divisors of k (A000203) and tau(k) = the number of divisors of k (A000005).
  • A324511 (program): Numbers m such that Product_{d|m} (sigma(d)/tau(d)) is an integer h where sigma(k) = the sum of the divisors of k (A000203) and tau(k) = the number of divisors of k (A000005).
  • A324521 (program): Numbers > 1 where the maximum prime index is less than or equal to the number of prime factors counted with multiplicity.
  • A324522 (program): Numbers > 1 where the minimum prime index is equal to the number of prime factors counted with multiplicity.
  • A324528 (program): a(n) = lcm(tau(n), pod(n)) where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955).
  • A324529 (program): a(n) = lcm(sigma(n), pod(n)) where sigma(k) = the sum of divisors of k (A000203) and pod(n) = the product of divisors of k (A007955).
  • A324534 (program): The smallest common prime factor of sigma(n) and A276086(n), or 1 if no such prime exists.
  • A324560 (program): Numbers > 1 where the minimum prime index is less than or equal to the number of prime factors counted with multiplicity.
  • A324562 (program): Numbers > 1 where the maximum prime index is greater than or equal to the number of prime factors counted with multiplicity.
  • A324568 (program): a(n) = Sum_{i=0..n, j=0..n} (binomial(2*i, j) + binomial(2*j, i)).
  • A324573 (program): a(1) = 0; for n > 1, a(n) = sigma(A048675(n)).
  • A324574 (program): a(1) = 0; for n > 1, a(n) = A033879(A087207(n)).
  • A324575 (program): a(1) = 0; for n > 1, a(n) = A033879(A048675(n)).
  • A324580 (program): a(n) = n * A276086(n).
  • A324583 (program): Numbers k such that k and A276086(k) are coprime, where A276086 is the primorial base exp-function.
  • A324584 (program): Numbers n that share a prime factor with A276086(n).
  • A324591 (program): E.g.f.: exp(2 * (x + x^2 / 2 + x^3 / 3)).
  • A324600 (program): a(n) = (k(n)*(k(n) + 1))/2 with k = A018252 (nonprime numbers), for n >= 1.
  • A324644 (program): a(n) = gcd(sigma(n), A276086(n)).
  • A324645 (program): a(n) = gcd(d(n), A276086(n)), where d(n) gives the number of divisors (A000005).
  • A324646 (program): a(n) = gcd(n, A276086(n-1)).
  • A324648 (program): a(n) = n - A318458(n), where A318458(n) is bitwise-AND of n and the sum of proper divisors of n (sigma(n)-n).
  • A324649 (program): Numbers k such that A318458(k) (bitwise-AND of k and sigma(k)-k) is equal to k.
  • A324650 (program): a(n) = A000010(A276086(n)).
  • A324651 (program): Bisection of A324650: a(n) = A000010(A276086(2*n)).
  • A324652 (program): Numbers k such that A318468(k) (bitwise-AND of 2*k and sigma(k)) is equal to 2*k.
  • A324653 (program): a(n) = A000203(A276086(n)).
  • A324654 (program): a(n) = A033879(A276086(n)).
  • A324655 (program): a(n) = A000005(A276086(n)).
  • A324658 (program): a(n) = n - A324659(n), where A324659(n) is half of bitwise-AND of 2*n and sigma(n).
  • A324659 (program): a(n) = (1/2)*A318468(n), where A318468(n) is bitwise-AND of 2*n and sigma(n).
  • A324713 (program): a(n) = 2*A156552(n) XOR A323243(n).
  • A324716 (program): a(n) = 2*A156552(n) - bitand(2*A156552(n), A323243(n)), where bitand is bitwise-AND, A004198.
  • A324721 (program): Positions of positive terms in A323244; numbers n for which 2*A156552(n) > A323243(n).
  • A324729 (program): a(n) = A000120(A323243(n)).
  • A324732 (program): Characteristic function of A324721: a(n) = 1 if 2*A156552(n) > A323243(n), and 0 otherwise.
  • A324740 (program): Number of simple graphs on n unlabeled nodes with maximum degree exactly 2.
  • A324758 (program): Heinz numbers of integer partitions containing no prime indices of the parts.
  • A324761 (program): Heinz numbers of integer partitions not containing 1 or any prime indices of the parts.
  • A324772 (program): The “Octanacci” sequence: Trajectory of 0 under the morphism 0->{0,1,0}, 1->{0}.
  • A324795 (program): a(n) = 2*p(n)*p(n+2)-p(n+1)^2 where p(k) = k-th prime.
  • A324798 (program): a(n) = floor(sqrt(2)*prime(n)) - prime(n+1).
  • A324815 (program): a(n) = 2*A156552(n) AND A323243(n), where AND is bitwise-and, A004198.
  • A324816 (program): Binary weight of A324815; number of 1-bits in common positions in 2*A156552(n) and A323243(n).
  • A324819 (program): a(n) = 2*A156552(n) OR A323243(n), where OR is bitwise-OR, A003986.
  • A324822 (program): a(n) = 1 if A156552(n) is a square, 0 otherwise.
  • A324823 (program): a(n) = 1 if n > 1 and A156552(n) is a square or a twice a square, 0 otherwise.
  • A324824 (program): a(n) = 1 if n>1 and sigma(A156552(n)) is congruent to 2 modulo 4, otherwise a(n) = 0.
  • A324825 (program): Number of divisors d of n such that A323243(d) is odd; number of terms of A324813 larger than 1 that divide n.
  • A324863 (program): Binary length of A324866(n), where A324866(n) = A156552(n) OR (A323243(n) - A156552(n)).
  • A324865 (program): a(n) = A323243(n) - A156552(n).
  • A324866 (program): a(n) = A156552(n) OR A324865(n), where OR is bitwise-OR, A003986.
  • A324867 (program): a(n) = A156552(n) XOR A324865(n), where XOR is bitwise-xor, A003987.
  • A324868 (program): Binary weight of A324398(n).
  • A324873 (program): a(n) = gcd(n, A060968(n)).
  • A324874 (program): a(n) is the binary length of A324398(n), where A324398(n) = A156552(n) AND (A323243(n) - A156552(n)).
  • A324881 (program): Number of nonleading zeros in binary representation of A324398, where A324398(n) = A156552(n) AND (A323243(n) - A156552(n)).
  • A324882 (program): a(1) = 0; for n > 1, a(n) = A001511(A324866(n)), where A324866(n) = A156552(n) OR (A323243(n) - A156552(n)).
  • A324883 (program): a(n) = 1 if A055396(n) < A324885(n), otherwise 0.
  • A324884 (program): a(1) = 0; for n > 1, a(n) = A001511(A324819(n)), where A324819(n) = 2*A156552(n) OR A323243(n).
  • A324885 (program): a(1) = 0; for n > 1, a(n) = A001511(A323243(n)).
  • A324886 (program): a(n) = A276086(A108951(n)).
  • A324887 (program): a(n) = A108951(n) * A276086(A108951(n)).
  • A324888 (program): Minimal number of primorials (A002110) that add to A108951(n).
  • A324891 (program): a(n) = sigma(A170818(n)), where A170818(n) is the part of n composed of prime factors of form 4k+1.
  • A324893 (program): a(n) = sigma(A097706(n)), where A097706(n) is the part of n composed of prime factors of form 4k+3.
  • A324895 (program): Largest proper divisor of A276086(n); a(0) = 1.
  • A324896 (program): Largest proper divisor of A324886(n).
  • A324899 (program): Odd numbers n for which sigma(n) == 3 (mod 4).
  • A324902 (program): The 2-adic valuation of A318456(n), where A318456(n) = n OR (sigma(n)-n).
  • A324903 (program): a(n) = 1 if A007814(sigma(n)) > A007814(n), 0 otherwise. Here A007814(n) gives the 2-adic valuation of n.
  • A324904 (program): The 2-adic valuation of A318466(n), where A318466(n) = 2*n OR sigma(n).
  • A324905 (program): a(n) = A007895(A003965(n)).
  • A324906 (program): Number of trailing 1-bits in the binary representation of A318466(n), where A318466(n) = 2*n OR sigma(n).
  • A324908 (program): a(n) = 1 if n is an odd number which is not a square, 0 otherwise.
  • A324909 (program): Odd numbers n for which sigma(n^2) == 3 (mod 4).
  • A324910 (program): Multiplicative with a(p^e) = (2^e)-1.
  • A324912 (program): Binary weight of A324911(n).
  • A324913 (program): a(n) = Sum_{k=1..n} 2^k * phi(k), where phi is the Euler totient function A000010.
  • A324914 (program): a(n) = Sum_{k=1..n} 2^k * tau(k), where tau(k) = A000005(k).
  • A324915 (program): a(n) = Sum_{k=1..n} 2^k * sigma(k), where sigma(k) = A000203(k).
  • A324920 (program): a(n) is the number of iterations of the integer splitting function (A056737) necessary to reach zero.
  • A324922 (program): a(n) = unique m such that m/A003963(m) = n, where A003963 is product of prime indices.
  • A324923 (program): Number of distinct factors in the factorization of n into factors q(i) = prime(i)/i, i > 0.
  • A324927 (program): Matula-Goebel numbers of rooted trees of depth 2. Numbers that are not powers of 2 but whose prime indices are all powers of 2.
  • A324928 (program): Matula-Goebel numbers of rooted trees of depth 3.
  • A324929 (program): Numbers whose product of prime indices is even.
  • A324930 (program): Total weight of the multiset of multisets of multisets with MMM number n. Totally additive with a(prime(n)) = A302242(n).
  • A324932 (program): Numerator in the division of n by the product of prime indices of n.
  • A324933 (program): Denominator in the division of n by the product of prime indices of n.
  • A324937 (program): Triangle read by rows: T(n, k) = 2*n*k + n + k - 8.
  • A324940 (program): Numbers of the form x^2+7*y^2+7*z^2.
  • A324964 (program): a(n) = A000139(n) mod 2; Characteristic function of odd fibbinary numbers (A022341).
  • A324965 (program): Partial sums of A324964.
  • A324966 (program): Number of distinct odd prime indices of n.
  • A324967 (program): Number of distinct even prime indices of n.
  • A324969 (program): Number of unlabeled rooted identity trees with n vertices whose non-leaf terminal subtrees are all different.
  • A324980 (program): a(n) = Product_{d|n} (d*sigma(d)) where sigma(k) = the sum of the divisors of k (A000203).
  • A324981 (program): a(n) = Product_{d|n} (d*pod(d)) where pod(k) = the product of the divisors of k (A007955).
  • A324986 (program): a(n) = Sum_{d|n} (tau(d)*sigma(d)) where tau(k) = the number of divisors of k (A000005) and sigma(k) = the sum of the divisors of k (A000203).
  • A324987 (program): a(n) = Product_{d|n} (tau(d)*sigma(d)) where tau(k) = the number of divisors of k (A000005) and sigma(k) = the sum of the divisors of k (A000203).
  • A324999 (program): Array read by descending antidiagonals: A(n,k) is the number of oriented colorings of the facets (or vertices) of a regular n-dimensional simplex using up to k colors.
  • A325000 (program): Array read by descending antidiagonals: T(n,k) is the number of unoriented colorings of the facets (or vertices) of a regular n-dimensional simplex using up to k colors.
  • A325001 (program): Array read by descending antidiagonals: A(n,k) is the number of achiral colorings of the facets (or vertices) of a regular n-dimensional simplex using up to k colors.
  • A325002 (program): Triangle read by rows: T(n,k) is the number of oriented colorings of the facets (or vertices) of a regular n-dimensional simplex using exactly k colors.
  • A325003 (program): Triangle read by rows: T(n,k) is the number of achiral colorings of the facets (or vertices) of a regular n-dimensional simplex using exactly k colors.
  • A325005 (program): Array read by descending antidiagonals: A(n,k) is the number of unoriented colorings of the facets of a regular n-dimensional orthotope using up to k colors.
  • A325006 (program): Array read by descending antidiagonals: A(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthotope using up to k colors.
  • A325029 (program): a(n) = Sum_{d|n} (sigma(d)*pod(d)) where sigma(k) = the sum of the divisors of k (A000203) and pod(k) = the product of the divisors of k (A007955).
  • A325030 (program): a(n) = Product_{d|n} (sigma(d)*pod(d)) where sigma(k) = the sum of the divisors of k (A000203) and pod(k) = the product of the divisors of k (A007955).
  • A325032 (program): Product of products of the multisets of prime indices of each prime index of n.
  • A325033 (program): Sum of sums of the multisets of prime indices of each prime index of n.
  • A325034 (program): Sum of products of the multisets of prime indices of each prime index of n.
  • A325036 (program): Difference between product and sum of prime indices of n.
  • A325037 (program): Heinz numbers of integer partitions whose product of parts is greater than their sum.
  • A325042 (program): Heinz numbers of integer partitions whose product of parts is one fewer than their sum.
  • A325050 (program): a(n) = Product_{k=0..n} (k!^2 + 1).
  • A325095 (program): Number of subsets of {1…n} with no binary carries.
  • A325100 (program): Heinz numbers of strict integer partitions with no binary carries.
  • A325101 (program): Number of divisible binary-containment pairs of positive integers up to n.
  • A325102 (program): Number of ordered pairs of positive integers up to n with no binary carries.
  • A325103 (program): Number of increasing pairs of positive integers up to n with no binary carries.
  • A325104 (program): Number of increasing pairs of positive integers up to n with at least one binary carry.
  • A325106 (program): Number of divisible binary-containment pairs of positive integers up to n.
  • A325114 (program): Integers such that no nonzero subsequence of decimal representation is divisible by 7.
  • A325120 (program): Sum of binary lengths of the prime indices of n.
  • A325121 (program): Sum of binary digits of the prime indices of n.
  • A325126 (program): a(1) = 1; a(n) = -Sum_{d|n, d<n} rad(n/d) * a(d), where rad = A007947.
  • A325128 (program): Numbers in whose prime factorization the exponent of prime(k) is less than k for all prime indices k.
  • A325131 (program): Heinz numbers of integer partitions where the set of distinct parts is disjoint from the set of distinct multiplicities.
  • A325133 (program): Heinz number of the integer partition obtained by removing the inner lining, or, equivalently, the largest hook, of the integer partition with Heinz number n.
  • A325134 (program): a(1) = 1; a(n) = number of prime factors of n counted with multiplicity plus the largest prime index of n.
  • A325136 (program): The product of primes <= 2n that are strongly prime to 2n, bisection of A181836.
  • A325138 (program): a(n) = Sum_{k=0..n} Sum_{j=0..n-k} binomial(j+k, k)*|Stirling1(n, j+k)|*(k+1)^j.
  • A325140 (program): a(n) = Sum_{k=0..n} Sum_{j=0..n-k} binomial(j+k, k)*|Stirling1(n, j+k)|*(k+2)^j.
  • A325144 (program): a(n) = - Sum_{d | n} (-1)^d *a(d) if n != 1, a(1) = 1.
  • A325153 (program): A column of triangle A322220; a(n) = A322220(n,1) for n >= 1.
  • A325156 (program): G.f.: A(x) = Sum_{n>=0} x^n * (1 + (-1)^n * sqrt(A(x)))^n / (1 - (-1)^n * x*sqrt(A(x)))^(n+1).
  • A325157 (program): G.f.: A(x) = Sum_{n>=0} x^n * (1 + (-1)^n * A(x))^n / (1 - (-1)^n * x*A(x))^(n+1).
  • A325160 (program): Products of distinct, non-consecutive primes. Squarefree numbers not divisible by any two consecutive primes.
  • A325161 (program): Nonprime squarefree numbers not divisible by any two consecutive primes.
  • A325164 (program): Heinz numbers of integer partitions with Durfee square of length 2.
  • A325168 (program): Number of integer partitions of n with origin-to-boundary graph-distance equal to 2.
  • A325169 (program): Origin-to-boundary graph-distance of the Young diagram of the integer partition with Heinz number n.
  • A325170 (program): Heinz numbers of integer partitions with origin-to-boundary graph-distance equal to 2.
  • A325171 (program): Down-integers: integers k such that w_(s+1) = floor(phi*k) for some k-slow Fibonacci walk, with phi=(1+sqrt(5))/2. See comments for further explanation.
  • A325172 (program): Up-integers: integers k such that w_(s+1) = ceiling(phi*k) for some k-slow Fibonacci walk, with phi=(1+sqrt(5))/2. See comments for further explanation.
  • A325173 (program): Perfect squares of the form a + b^2 + c^3, where a,b,c are consecutive numbers.
  • A325181 (program): Number of integer partitions of n such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 1.
  • A325191 (program): Number of integer partitions of n such that the difference between the length of the minimal triangular partition containing and the maximal triangular partition contained in the Young diagram is 1.
  • A325223 (program): Sum of the prime indices of n minus the greater of the number of prime factors of n counted with multiplicity and the largest prime index of n.
  • A325224 (program): Sum of prime indices of n minus the lesser of the number of prime factors of n counted with multiplicity and the maximum prime index of n.
  • A325225 (program): Lesser of the number of prime factors of n counted with multiplicity and the maximum prime index of n.
  • A325226 (program): Number of prime factors of n that are less than the largest, counted with multiplicity.
  • A325229 (program): Heinz numbers of integer partitions such that lesser of the maximum part and the number of parts is 2.
  • A325230 (program): Numbers of the form p^k * q, p and q prime, p > q, k > 0.
  • A325231 (program): Numbers of the form 2 * p or 3 * 2^k, p prime, k > 1.
  • A325233 (program): Heinz numbers of integer partitions with Dyson rank 1.
  • A325234 (program): Heinz numbers of integer partitions with Dyson rank -1.
  • A325235 (program): Heinz numbers of integer partitions with Dyson rank 1 or -1.
  • A325240 (program): Numbers whose minimum prime exponent is 2.
  • A325247 (program): Numbers whose omega-sequence is strict (no repeated parts).
  • A325249 (program): Sum of the omega-sequence of n.
  • A325251 (program): Numbers whose omega-sequence covers an initial interval of positive integers.
  • A325259 (program): Numbers with one fewer distinct prime exponents than distinct prime factors.
  • A325261 (program): Numbers whose omega-sequence does not cover an initial interval of positive integers.
  • A325264 (program): Numbers whose omega-sequence sums to 7.
  • A325265 (program): Numbers with sum of omega-sequence > 4.
  • A325266 (program): Numbers whose adjusted frequency depth equals their number of prime factors counted with multiplicity.
  • A325269 (program): Number of integer partitions of n with 2 distinct parts or at least 3 parts.
  • A325281 (program): Numbers of the form a*b, a*a*b, or a*a*b*c where a, b, and c are distinct primes. Numbers with sorted prime signature (1,1), (1,2), or (1,1,2).
  • A325282 (program): Maximum adjusted frequency depth among integer partitions of n.
  • A325284 (program): Numbers whose prime indices form an initial interval with a single hole: (1, 2, …, x, x + 2, …, m - 1, m), where x can be 0 but must be less than m - 1.
  • A325299 (program): a(n) = 9 * sigma(n).
  • A325313 (program): a(n) = A048250(n) - n, where A048250(n) is the sum of squarefree divisors of n.
  • A325314 (program): a(n) = n - A162296(n), where A162296(n) is the sum of divisors of n that have a square factor.
  • A325321 (program): a(n) = 1 if cototient of n is a square, 0 otherwise.
  • A325334 (program): Number of integer partitions of n with adjusted frequency depth 3 whose parts cover an initial interval of positive integers.
  • A325337 (program): Numbers whose prime exponents are distinct and cover an initial interval of positive integers.
  • A325339 (program): Number of divisors of n^3 that are <= n.
  • A325359 (program): Numbers of the form p^y * 2^z where p is an odd prime, y >= 2, and z >= 0.
  • A325370 (program): Numbers whose prime signature has multiplicities covering an initial interval of positive integers.
  • A325371 (program): Numbers whose prime signature has multiplicities of its parts all distinct and covering an initial interval of positive integers.
  • A325385 (program): a(n) = gcd(n-A048250(n), n-A162296(n)).
  • A325392 (program): Number of permutations of the multiset of prime factors of n whose first part is not 2.
  • A325395 (program): Heinz numbers of integer partitions whose augmented differences are strictly increasing.
  • A325401 (program): minflip(n) = min(n, r(n)) where r(n) is the binary reverse of n.
  • A325402 (program): maxflip(n) = max(n, r(n)) where r(n) is the binary reverse of n.
  • A325403 (program): Number of permutations of the multiset of prime factors of 2n whose first part is not 2.
  • A325411 (program): Numbers whose omega-sequence has repeated parts.
  • A325413 (program): Largest sum of the omega-sequence of an integer partition of n.
  • A325424 (program): Complement of A036668: numbers not of the form 2^i*3^j*k, i + j even, (k,6) = 1.
  • A325431 (program): a(n) is the least number not 3*a(m) or 4*a(m) for any m < n.
  • A325432 (program): Complement of A325431.
  • A325435 (program): Numbers m such that m! / sigma(m) is an integer.
  • A325437 (program): Final digit of primes of the form k^2 + 1.
  • A325446 (program): The unitary version of Kalmár’s function: number of ordered factorizations of n into powers of distinct primes.
  • A325454 (program): a(n) is the digit sum of the n-th Niven number (or Harshad number).
  • A325459 (program): Sum of numbers of nontrivial divisors (greater than 1 and less than k) of k for k = 1..n.
  • A325469 (program): a(n) is the number of divisors d of n such that d divides sigma(d).
  • A325470 (program): a(n) is the sum of divisors d of n such that d divides sigma(d).
  • A325473 (program): Number of compositions of n with no part divisible by 3 and an even number of parts congruent to 4 or 5 modulo 6.
  • A325475 (program): a(n) = (24*n)^2.
  • A325482 (program): Number of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly two colors are used.
  • A325483 (program): Numbers whose sum of their decimal digits is less than or equal to the sum of the digits of their binary representation.
  • A325484 (program): One of the four successive approximations up to 5^n for the 5-adic integer 6^(1/4). This is the 1 (mod 5) case (except for n = 0).
  • A325485 (program): One of the four successive approximations up to 5^n for the 5-adic integer 6^(1/4). This is the 2 (mod 5) case (except for n = 0).
  • A325486 (program): One of the four successive approximations up to 5^n for the 5-adic integer 6^(1/4). This is the 3 (mod 5) case (except for n = 0).
  • A325487 (program): One of the four successive approximations up to 13^n for the 13-adic integer 6^(1/4). This is the 4 (mod 5) case (except for n = 0).
  • A325488 (program): Dimensions of space of harmonic polynomials of each degree invariant under the full icosahedral group.
  • A325489 (program): Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 1 mod 5.
  • A325490 (program): Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 2 mod 5.
  • A325491 (program): Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 3 mod 5.
  • A325492 (program): Digits of one of the four 5-adic integers 6^(1/4) that is congruent to 4 mod 5.
  • A325498 (program): Difference sequence of A036668.
  • A325499 (program): Difference sequence of A325424.
  • A325511 (program): Numbers whose prime signature is that of a factorial number.
  • A325516 (program): Triangle read by rows: T(n, k) = (1/4)*n*(1 - (-1)^(n - k) + 2*(n - k)^2), with 0 <= k < n.
  • A325517 (program): a(n) = n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24.
  • A325524 (program): Difference sequence of A325431.
  • A325525 (program): Difference sequence of A325432.
  • A325543 (program): Width (number of leaves) of the rooted tree with Matula-Goebel number n!.
  • A325544 (program): Number of nodes in the rooted tree with Matula-Goebel number n!.
  • A325580 (program): G.f.: A(x,y) = Sum_{n>=0} x^n * ((1+x)^n + y)^n, where A(0) = 0, as a triangle of coefficients T(n,k) of x^n*y^k in A(x,y) = Sum_{n>=0} x^n * Sum_{k=0..n} T(n,k)*x^n*y^k, read by rows.
  • A325581 (program): G.f.: Sum_{n>=0} (n+1) * x^n * (1+x)^(n*(n+1)).
  • A325586 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * x^n * (1+x)^(n*(n+2)).
  • A325587 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * x^n * (1+x)^(n*(n+3)).
  • A325596 (program): a(n) = Sum_{d|n} mu(n/d) * (-1)^(d + 1) * d.
  • A325597 (program): a(n) is the least number not 2a(m) + a(m-1) for any m < n.
  • A325598 (program): Complement of A325597.
  • A325599 (program): Difference sequence of A325597.
  • A325600 (program): Positions of 1 in A325599.
  • A325601 (program): Positions of 2 in A325599.
  • A325617 (program): Multinomial coefficient of the prime signature of n!.
  • A325636 (program): a(n) = gcd(2n, sigma(n)).
  • A325644 (program): “Sloping quaternary numbers”: write numbers in quaternary under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325645 (program): “Sloping quinary numbers”: write numbers in quinary under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325646 (program): Number of separable partitions of n in which the number of distinct (repeatable) parts is 2.
  • A325656 (program): a(n) = (1/24)*n*((4*n + 3)*(2*n^2 + 1) - 3*(-1)^n).
  • A325657 (program): a(n) = (1/2)*(-1 + (-1)^n)*(n-1) + n^2.
  • A325660 (program): Number of ones in the q-signature of n.
  • A325661 (program): q-powerful numbers. Numbers whose factorization into factors prime(i)/i has no factor of multiplicity 1.
  • A325664 (program): First term of n-th difference sequence of (floor[k*r]), r = sqrt(2), k >= 0.
  • A325665 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(2), k >= 0.
  • A325666 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(3), k >= 0.
  • A325667 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(3), k >= 0.
  • A325668 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(5), k >= 0.
  • A325669 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(5), k >= 0.
  • A325670 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(6), k >= 0.
  • A325671 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(6), k >= 0.
  • A325672 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(7), k >= 0.
  • A325673 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(7), k >= 0.
  • A325674 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(8), k >= 0.
  • A325675 (program): First term of n-th difference sequence of (floor(k*r)), r = -sqrt(8), k >= 0.
  • A325685 (program): Number of compositions of n whose distinct consecutive subsequences have different sums, and such that these sums cover an initial interval of positive integers.
  • A325688 (program): Number of length-3 compositions of n such that every distinct consecutive subsequence has a different sum.
  • A325689 (program): Number of length-3 compositions of n such that no part is the sum of the other two.
  • A325690 (program): Number of length-3 integer partitions of n whose largest part is not the sum of the other two.
  • A325691 (program): Number of length-3 integer partitions of n whose largest part is not greater than the sum of the other two.
  • A325692 (program): “Sloping senary numbers”: write numbers in senary (that is, base 6) under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325693 (program): “Sloping septenary numbers”: write numbers in septenary under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325695 (program): Number of length-3 strict integer partitions of n such that the largest part is not the sum of the other two.
  • A325696 (program): Number of length-3 strict compositions of n such that no part is the sum of the other two.
  • A325698 (program): Numbers with as many even as odd prime indices, counted with multiplicity.
  • A325699 (program): Number of distinct even prime indices of n minus the number of distinct odd prime indices of n.
  • A325700 (program): Numbers with as many distinct even as distinct odd prime indices.
  • A325711 (program): Number of separable partitions of n in which the number of distinct (repeatable) parts <= 2.
  • A325729 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(1/2), k >= 0.
  • A325730 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(1/3), k >= 0.
  • A325732 (program): First term of n-th difference sequence of (floor(k*r)), r = sqrt(3/4), k >= 0.
  • A325733 (program): First term of n-th difference sequence of (floor(k*r)), r = 1/2 + sqrt(2), k >= 0.
  • A325734 (program): First term of n-th difference sequence of (floor(k*e)), k >= 0.
  • A325735 (program): First term of n-th difference sequence of (floor(-k*e)), k >= 0.
  • A325736 (program): First term of n-th difference sequence of (floor(2e*k)), k >= 0.
  • A325737 (program): First term of n-th difference sequence of (floor(3e*k)), k >= 0.
  • A325738 (program): First term of n-th difference sequence of (floor(e*k/2)), k >= 0.
  • A325739 (program): First term of n-th difference sequence of (floor(Pi*k)), k >= 0.
  • A325740 (program): First term of n-th difference sequence of (floor(2*Pi*k)), k >= 0.
  • A325741 (program): First term of n-th difference sequence of (floor(Pi*k/2)), k >= 0.
  • A325742 (program): First term of n-th difference sequence of (floor(Pi*k/3)), k >= 0.
  • A325743 (program): First term of n-th difference sequence of (floor(Pi*k/4)), k >= 0.
  • A325744 (program): First term of n-th difference sequence of (floor(Pi*k/6)), k >= 0.
  • A325745 (program): First term of n-th difference sequence of (floor(r*k)), r = (1+sqrt(5))/2, k >= 0.
  • A325746 (program): First term of n-th difference sequence of (floor(r*k)), r = -(1+sqrt(5))/2, k >= 0.
  • A325747 (program): First term of n-th difference sequence of (floor(r*k)), r = (3+sqrt(5))/2, k >= 0.
  • A325748 (program): First term of n-th difference sequence of (floor(k/e)), k >= 0.
  • A325749 (program): First term of n-th difference sequence of (floor(e*k/(e-1))), k >= 0.
  • A325750 (program): First term of n-th difference sequence of (floor(r*k)), r = (1+sqrt(3))/2, k >= 0.
  • A325755 (program): Numbers n divisible by their prime shadow A181819(n).
  • A325759 (program): Number of distinct frequencies in the frequency span of n.
  • A325760 (program): Heinz number of the frequency span of n.
  • A325765 (program): Number of integer partitions of n with a unique consecutive subsequence summing to every positive integer from 1 to n.
  • A325770 (program): Number of distinct nonempty contiguous subsequences of the integer partition with Heinz number n.
  • A325784 (program): Reading the first row of this array or its successive antidiagonals is the same as reading this sequence.
  • A325785 (program): Reading the first column of this array or its successive antidiagonals is the same as reading this sequence.
  • A325794 (program): Number of divisors of n minus the sum of prime indices of n.
  • A325795 (program): Numbers with more divisors than the sum of their prime indices.
  • A325796 (program): Numbers with at least as many divisors as the sum of their prime indices.
  • A325797 (program): Numbers with fewer divisors than the sum of their prime indices.
  • A325798 (program): Numbers with at most as many divisors as the sum of their prime indices.
  • A325803 (program): Nonzero terms of Product_{k=0..floor(log_2(n))} (1 + A004718(floor(n/(2^k)))).
  • A325804 (program): Positions of nonzero terms of Product_{k=0..floor(log_2(n))} (1 + A004718(floor(n/(2^k)))).
  • A325805 (program): “Sloping octal numbers”: write numbers in octal under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325813 (program): a(n) = gcd(A034448(n)-n, n-A048146(n)), where A034448 and A048146 are respectively the sum of unitary and non-unitary divisors of n.
  • A325814 (program): a(n) = n - A048146(n), where A048146 is the sum of non-unitary divisors of n.
  • A325829 (program): “Sloping nonary numbers”: write numbers in nonary under each other (right-justified), read diagonals in upward direction, convert to decimal.
  • A325837 (program): The number of exponentially odd divisors of n.
  • A325838 (program): a(n) is the product of divisors of the n-th triangular number.
  • A325840 (program): First term of n-th difference sequence of (round(k*sqrt(2))), k >= 0.
  • A325841 (program): First term of n-th difference sequence of (round(k*sqrt(3))), k >= 0.
  • A325842 (program): First term of n-th difference sequence of (round(k*sqrt(5))), k >= 0.
  • A325843 (program): First term of n-th difference sequence of (round(k*sqrt(6))), k >= 0.
  • A325844 (program): First term of n-th difference sequence of (round(k*tau)), tau = golden ratio = (1+sqrt(5))/2, k >= 0.
  • A325845 (program): First term of n-th difference sequence of round((k*e)), k >= 0.
  • A325846 (program): First term of n-th difference sequence of round((k*Pi)), k >= 0.
  • A325887 (program): Excess of sum of odd integers up to n and coprime to n over sum of even integers up to n and coprime to n.
  • A325892 (program): The successive approximations up to 2^n for the 2-adic integer 3^(1/5).
  • A325893 (program): The successive approximations up to 2^n for 2-adic integer 5^(1/5).
  • A325894 (program): The successive approximations up to 2^n for the 2-adic integer 7^(1/5).
  • A325895 (program): The successive approximations up to 2^n for the 2-adic integer 9^(1/5).
  • A325896 (program): Digits of the 2-adic integer 3^(1/5).
  • A325897 (program): Digits of the 2-adic integer 5^(1/5).
  • A325898 (program): Digits of the 2-adic integer 7^(1/5).
  • A325899 (program): Digits of the 2-adic integer 9^(1/5).
  • A325905 (program): Decimal expansion of 2/e^2.
  • A325909 (program): Lexicographically earliest sequence of distinct positive terms such that for any n > 0, n divides Sum_{k = 1..n} (-1)^k * a(k).
  • A325911 (program): Screaming numbers in base 16: numbers whose hexadecimal representation is AAAAAAA…
  • A325913 (program): Integers m such that there are exactly two powers of 2 between 3^m and 3^(m+1).
  • A325931 (program): Signs of first differences of A076042.
  • A325937 (program): Expansion of Sum_{k>=1} (-1)^(k + 1) * x^(2*k) / (1 - x^k).
  • A325938 (program): a(n) = omega(n)^tau(n), where omega=A001221 and tau=A000005.
  • A325939 (program): Expansion of Sum_{k>=1} x^(2*k) / (1 + x^k).
  • A325940 (program): Expansion of Sum_{k>=1} x^(2*k) / (1 + x^k)^2.
  • A325941 (program): Expansion of Sum_{k>=1} k * x^(2*k) / (1 + x^k)^2.
  • A325943 (program): a(n) = floor(n / omega(n)) where omega = A001221.
  • A325946 (program): Maximum number of intercardinal adjacencies among all n-celled polyplets.
  • A325947 (program): a(n) = 4^n * [x^n] 1/sqrt(1-x) * Product_{k>=1} 1/(1 - x^k).
  • A325948 (program): a(n) = 4^n * [x^n] sqrt(1-x) * Product_{k>=1} 1/(1 - x^k).
  • A325951 (program): G.f.: 1/(1-x)^3 * Product_{k>=1} (1 + x^k).
  • A325952 (program): G.f.: 1/(1-x)^4 * Product_{k>=1} (1 + x^k).
  • A325958 (program): Sum of the corners of a 2n+1 X 2n+1 square spiral.
  • A325964 (program): a(n) = 1 if n and sigma(n) are relatively prime, 0 otherwise, where sigma(n) = sum of divisors of n, A000203; Characteristic function of A014567.
  • A325973 (program): Arithmetic mean of {sum of unitary divisors} and {sum of squarefree divisors}: a(n) = (1/2) * (A034448(n) + A048250(n)).
  • A325974 (program): Arithmetic mean of {sum of non-unitary divisors} and {sum of nonsquarefree divisors}: a(n) = (1/2)*(A048146(n) + A162296(n)).
  • A325975 (program): a(n) = gcd(A325977(n), A325978(n)).
  • A325977 (program): a(n) = (1/2)*(A034460(n) + A325313(n)).
  • A325978 (program): a(n) = (1/2)*(A325314(n) + A325814(n)).
  • A325988 (program): Number of covering (or complete) factorizations of n.
  • A325989 (program): Number of perfect factorizations of n.
  • A325997 (program): G.f.: Sum_{n>=0} (n+1) * (x + x^n)^n.
  • A325998 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * (x + x^n)^n.
  • A325999 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * (x + x^n)^n.
  • A326002 (program): G.f.: Sum_{n>=0} (n+1) * x^n * (1 + x^n)^n.
  • A326003 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * x^n * (1 + x^n)^n.
  • A326004 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * x^n * (1 + x^n)^n.
  • A326005 (program): G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)*(n+4)/4! * x^n * (1 + x^n)^n.
  • A326011 (program): a(n) = (n+1) * (2^n + 1)^n.
  • A326012 (program): a(n) = (n+1)*(n+2)/2 * (2^n + 1)^n.
  • A326013 (program): a(n) = (n+1) * (3^n + 1)^n.
  • A326031 (program): Weight of the set-system with BII-number n.
  • A326032 (program): a(2^x + … + 2^z) = w(x) + … + w(z), where x…z are distinct nonnegative integers and w = A000120.
  • A326034 (program): Number of knapsack partitions of n with largest part 3.
  • A326038 (program): Square root of the largest square dividing the sum of divisors of n: a(n) = A000188(sigma(n)).
  • A326039 (program): Largest square dividing the sum of divisors of n: a(n) = A008833(sigma(n)).
  • A326040 (program): a(n) = sigma(n) - A008833(sigma(n)).
  • A326041 (program): a(n) = sigma(A064989(n)).
  • A326042 (program): a(n) = A064989(sigma(A003961(n))), where A003961 shifts the prime factorization of n one step towards larger primes, and A064989 shifts it back towards smaller primes.
  • A326044 (program): a(n) = n - {the largest square dividing its sum of divisors}: a(n) = n - A008833(sigma(n)).
  • A326045 (program): a(n) is the sum of divisors of n, minus the largest square dividing that sum, minus n: a(n) = sigma(n) - A008833(sigma(n)) - n.
  • A326046 (program): a(n) = gcd(n-A326039(n), A326040(n)-n).
  • A326047 (program): a(n) = gcd(n-A050449(n), n-A050452(n)), where A050449 and A050452 give the sum of divisors of the form 4k+1 and of the form 4k+3, respectively.
  • A326048 (program): a(n) = gcd(n-A050449(n), A082052(n)-n), where A050449 and A082052 give the sum of divisors of the form 4k+1, and not of that form, respectively.
  • A326049 (program): a(n) = n - A050449(n), where A050449 is the sum of divisors of the form 4k+1.
  • A326050 (program): a(n) = A082052(n) - n, where A082052 is the sum of divisors of n that are not of the form 4k+1.
  • A326052 (program): a(n) = n - A050452(n), where A050452 is the sum of divisors of the form 4k+3.
  • A326053 (program): Sum of all other divisors of n except the largest square divisor: a(n) = sigma(n) - A008833(n).
  • A326054 (program): a(n) = A326053(n) - n, where A326053 gives the sum of all other divisors of n except the largest square divisor.
  • A326055 (program): a(n) = n - {the largest square that divides n}.
  • A326056 (program): a(n) = gcd(sigma(n)-A008833(n)-n, n-A008833(n)), where sigma is the sum of divisors of n, and A008833 is the largest square dividing n.
  • A326057 (program): a(n) = gcd(A003961(n)-2n, A003961(n)-sigma(n)), where A003961(n) is fully multiplicative function with a(prime(k)) = prime(k+1).
  • A326058 (program): a(n) = n - {the sum of square divisors of n}.
  • A326059 (program): a(n) = A285309(n) - n, where A285309 gives the sum of nonsquare divisors of n.
  • A326060 (program): a(n) = gcd(n-A035316(n), A285309(n)-n), where A035316 and A285309 give respectively the sums of square and nonsquare divisors of n.
  • A326061 (program): Sum of all other divisors of n except the largest proper divisor. a(1) = 0 by convention.
  • A326062 (program): a(1) = gcd((sigma(n)-A032742(n))-n, n-A032742(n)), where A032742 gives the largest proper divisor of n.
  • A326065 (program): Sum of divisors of the largest proper divisor of n: a(n) = sigma(A032742(n)).
  • A326066 (program): a(n) = sigma(n) - sigma(A032742(n)), where A032742 gives the largest proper divisor of n.
  • A326067 (program): a(n) = sigma(n) - sigma(A032742(n)) - n, where A032742 gives the largest proper divisor of n, and sigma is the sum of divisors of n.
  • A326068 (program): a(n) = n - sigma(A032742(n)), where sigma is the sum of divisors of n and A032742 gives the largest proper divisor of n.
  • A326069 (program): a(n) = gcd((sigma(n) - sigma(A032742(n))) - n, n - sigma(A032742(n))), where A032742 gives the largest proper divisor of n.
  • A326073 (program): a(n) = gcd(1+n-A020639(n), 1+sigma(n)-A020639(n)-n), where A020639 gives the smallest prime factor of n (and 1 for 1), and sigma is the sum of divisors of n.
  • A326118 (program): a(n) is the largest number of squares of unit area connected only at corners and without holes that can be inscribed in an n X n square.
  • A326120 (program): a(n) is the concatenation of n^1, n^2, …, n^n.
  • A326121 (program): Expansion of Sum_{k>=1} k^2 * x^(2*k) / (1 - k * x^k).
  • A326122 (program): a(n) = 10 * sigma(n).
  • A326123 (program): a(n) is the sum of all divisors of the first n odd numbers.
  • A326124 (program): a(n) is the sum of all divisors of the first n positive even numbers.
  • A326125 (program): Expansion of Sum_{k>=1} k^2 * x^k / (1 + x^k)^2.
  • A326126 (program): Sum of all other divisors of n except the squarefree part of n: a(n) = sigma(n) - A007913(n).
  • A326127 (program): a(n) = A326126(n) - n, where A326126 gives the sum of all other divisors of n except the squarefree part of n.