List of integer sequences with links to LODA programs.

  • 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].
  • 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.
  • A300222 (program): In ternary (base-3) representation of n, replace 1’s with 0’s.
  • A300254 (program): a(n) = 25(n + 1)(4n + 3)(5*n + 4)/3.
  • A300270 (program): a(n) = Sum_ 1 <= i <= j <= n mu(ij)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].
  • 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).
  • A300326 (program): Sum of the largest possible permutations that can be written without repetition of digits in each base from binary to n+1.
  • 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.
  • A300451 (program): a(n) = (3n^2 - 3n + 8)*2^(n - 3).
  • A300518 (program): The greatest prime factor of the squarefree part of n, or 1 if n is square.
  • A300522 (program): a(n) = (5n + 3)(5n + 4)(5*n + 5)/6.
  • A300523 (program): a(n) = (5n + 5)(5n + 6)(5*n + 7)/6.
  • A300559 (program): a(n) = n*(n+1)!/2 + 1.
  • 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).
  • 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).
  • A300656 (program): Triangle read by rows: T(n,k) = 30k^2(n-k)^2 + 1; n >= 0, 0 <= k <= n.
  • A300659 (program): Product of digits of n!.
  • A300758 (program): a(n) = 2n(n+1)(2n+1).
  • A300846 (program): a(n) = 3(n - 1)^2n^3.
  • A300847 (program): a(n) = 12*binomial(n, 5).
  • A300850 (program): Number of 6-cycles in the n-odd graph.
  • 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.
  • A301270 (program): Number of labeled trees on n vertices containing two fixed non-adjacent edges.
  • A301291 (program): Expansion of (x^4+3x^3+x^2+3x+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.
  • A301298 (program): Expansion of (1 + 4x + 4x^2 + 4x^3 + x^4)/((1 - x)(1 - x^3)).
  • A301316 (program): a(n) = ((n-1)! + 1) mod n^2.
  • 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).
  • A301383 (program): Expansion of (1 + 3x - 2x^2)/(1 - 7x + 7x^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.
  • 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).
  • A301451 (program): Numbers congruent to 1, 7 mod 9.
  • A301454 (program): Number of strictly log-concave permutations of 1,…,n .
  • A301461 (program): Number of integers less than or equal to n whose largest prime factor is 3.
  • 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.
  • 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.
  • A301601 (program): Numbers k such that k^6 can be written as a sum of 11 positive 6th powers.
  • A301617 (program): Numbers not divisible by 2, 3 or 5 (A007775) with digital root 1.
  • 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.
  • A301647 (program): a(n) = n^3 - (n mod 2).
  • A301653 (program): Expansion of x(1 + 2x)/((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.
  • 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 + 5x + 4x^2 + 5x^3 + x^4)/((1 - x)(1 - x^3)).
  • A301695 (program): Expansion of (1 + 5x + 4x^2 + 5x^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.
  • 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.
  • 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.
  • A301726 (program): Coordination sequence for node of type V2 in “kra” 2-D tiling (or net).
  • A301727 (program): Partial sums of A301726.
  • 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+5x^5+4x^4+3x^3+5x^2+5*x+1)/(x^6-x^5-x+1).
  • A301755 (program): Decimal expansion of 3/8.
  • A301758 (program): Clique covering number of the n X n fiveleaper graph.
  • A301773 (program): Number of odd chordless cycles in the 2n-Moebius ladder graph.
  • A301774 (program): Number of chordless cycles in the (2n+1)-prism graph.
  • A301775 (program): Number of odd chordless cycles in the (2n+1)-web graph.
  • 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.
  • 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.
  • A301848 (program): Number of states generated by morphism during inflation stage of paper-folding sequence.
  • A301926 (program): a(n+3) = a(n) + 24*n + 32, a(0)=0, a(1)=3, a(2)=13.
  • 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.
  • A301973 (program): a(n) = (n^2 - 3n + 6)binomial(n+2,3)/4.
  • A301985 (program): a(n) = n^2 + 2329n + 1697.
  • 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.
  • A302048 (program): a(n) = 1 if n = p^2 for some prime p, otherwise 0. Characteristic function of squares of primes (A001248).
  • A302058 (program): Numbers that are not square pyramidal numbers.
  • A302245 (program): Maximum remainder of p*q divided by p+q with 0 < p <= q <= n.
  • 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.
  • 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.
  • 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).
  • A302338 (program): a(n) = 3*n + 2^v(n) where v(n) denotes the 2-adic valuation of n.
  • A302390 (program): Triameter of the n-cube-connected cycle graph.
  • 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.
  • 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.
  • A302451 (program): a(n) = [x^n] Product_ k>=0 (1 + n*x^(2^k)).
  • A302488 (program): Total domination number of the n X n grid graph.
  • A302507 (program): a(n) = 4*(3^n-1).
  • A302537 (program): a(n) = (n^2 + 13*n + 2)/2.
  • A302553 (program): Hyper-4 powers that are not hyper-5 powers.
  • 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.
  • A302576 (program): Numbers k such that k/10 + 1 is a square.
  • A302583 (program): a(n) = ((n + 1)^n - (n - 1)^n)/2.
  • A302588 (program): a(n) = a(n-3) + 7*(n-2), a(0)=1, a(1)=2, a(2)=4.
  • A302604 (program): Number of partitions of n into two parts such that the positive difference of the parts is squarefree.
  • 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) = (2n^2(n^2 - 3) - (2n^2 + 1)(-1)^n + 1)/64.
  • A302650 (program): Number of minimal total dominating sets in the n-barbell graph.
  • A302689 (program): a(n) = 4 + 2^n - 4*n.
  • 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(2n+1, 4) = (1/6)n(2n + 1)(2n^2 + 9*n + 1), n >= 0.
  • A302710 (program): a(n) = trinomial(2n, 4) = (1/6)n(2n - 1)(2n^2 + 7*n - 3).
  • A302748 (program): Half thrice the previous number, rounded down, plus 1, starting with 6.
  • 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(4n + 3) + 3n*(-1)^n - 4)/96.
  • A302761 (program): Number of total dominating sets in the n-barbell graph.
  • A302766 (program): a(n) = n((4n + 1)(7n - 4) + 15n(-1)^n)/48.
  • 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.
  • 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.
  • 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.
  • A302930 (program): Maximum number of 6’s possible in an infinite Minesweeper grid with n mines.
  • A302941 (program): Number of total dominating sets in the 2n-crossed prism graph.
  • A302946 (program): Number of minimal (and minimum) total dominating sets in the 2n-crossed prism 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.
  • A303120 (program): Total area of all rectangles of size p X q such that p + q = n^2 and p <= q.
  • A303212 (program): Number of minimum total dominating sets in the n X n rook complement graph.
  • 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.
  • A303272 (program): Multiples of 1852.
  • 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(19m - 17)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303299 (program): Generalized 22-gonal (or icosidigonal) numbers: m(10m - 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(21m - 19)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303304 (program): Generalized 25-gonal (or icosipentagonal) numbers: m(23m - 21)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303305 (program): Generalized 17-gonal (or heptadecagonal) numbers: m(15m - 13)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • 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.
  • A303383 (program): Total volume of all cubes with side length q such that n = p + q and p <= q.
  • A303384 (program): Total area of the family of rectangles with dimensions p and q where p divides q, n = p + q and p <= q.
  • A303449 (program): Denominator of (2n+1)/(2^(2n+1)-1).
  • 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).
  • 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.
  • A303557 (program): a(0) = 1; a(n) = 2^(n-1)*prime(n)#, where prime(n)# is the product of first n primes.
  • A303581 (program): Add i (>= 0) to the i-th block of terms in the Thue-Morse sequence A010060.
  • 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 kbinomial(2n+1, k).
  • A303609 (program): a(n) = 2n^3 + 9n^2 + 9*n.
  • A303611 (program): a(n) = (-1 - (-2)^(n-2)) mod 2^n.
  • A303658 (program): Decimal expansion of the alternating sum of the reciprocals of the triangular numbers.
  • A303692 (program): a(n) = n^2(2n - 3 - (-1)^n)/4.
  • A303735 (program): a(n) is the metric dimension of the n-dimensional hypercube.
  • A303749 (program): First differences of A302774; Number of terms in A303762 that have prime(n) as their largest prime factor (A006530).
  • A303781 (program): a(2) = 1; for n <> 2, a(n) = gcd(n, A000005(n)), where A000005(n) = number of divisors of n.
  • A303812 (program): Generalized 28-gonal (or icosioctagonal) numbers: m(13m - 12) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303813 (program): Generalized 19-gonal (or enneadecagonal) numbers: m(17m - 15)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303814 (program): Generalized 24-gonal (or icositetragonal) numbers: m(11m - 10) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A303815 (program): Generalized 29-gonal (or icosienneagonal) numbers: m(27m - 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.
  • A303873 (program): Total area of the family of squares with side length n such that n = p + q, p divides q and p < q.
  • A303916 (program): Constant term in the expansion of (Sum_ k=0..n k*(x^k + x^(-k)))^3.
  • A303977 (program): Number of inequivalent solutions to problem discussed in A286874.
  • 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).
  • A304041 (program): Number of inequivalent solutions to problem in A054961.
  • 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) = 2n^3 - 4n^2 + 6*n - 2 (n>=1).
  • A304160 (program): a(n) = n^4 - 3n^3 + 6n^2 - 5*n + 2 (n >= 1).
  • A304161 (program): a(n) = 2n^3 - 4n^2 + 10*n - 2 (n>=1).
  • A304162 (program): a(n) = n^4 - 3n^3 + 9n^2 - 7*n + 5 (n>=1).
  • A304163 (program): a(n) = 9n^2 - 3n + 1 with n>0.
  • A304164 (program): a(n) = 27n^2 - 21n + 6 (n>=1).
  • A304165 (program): a(n) = 324n^2 - 336n + 102 (n >= 1).
  • A304166 (program): a(n) = 972n^2 - 1224n + 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) = 323^n + 182^n - 116 (n>=1).
  • A304171 (program): a(n) = 87*2^n - 38 (n>=0).
  • A304172 (program): a(n) = 99*2^n - 45 (n>=0).
  • A304205 (program): Numbers k such that 24*k + 6 is congruent to 0 (mod 49).
  • 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.
  • 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) = 9n^2 + 21n - 6 (n>=1).
  • A304375 (program): a(n) = 27n^2/2 + 45n/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) = 36n^2 - 4n (n>=1).
  • A304381 (program): a(n) = 54n^2 - 26n + 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).
  • A304409 (program): If n = Product (p_j^k_j) then a(n) = Product (p_j*(k_j + 1)).
  • A304487 (program): a(n) = (3 + 2n - 3n^2 + 4n^3 - 3((-1 + n) mod 2))/6.
  • A304491 (program): Last or deepest exponent in the power-tower for n.
  • A304498 (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(3n+1)(9n+8)/2.
  • A304505 (program): a(n) = 4(n+1)(9*n+4).
  • A304506 (program): a(n) = 2(3n+1)(9n+8).
  • A304507 (program): a(n) = 5(n+1)(9*n+4).
  • A304508 (program): a(n) = 5(3n+1)(9n+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).
  • 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).
  • A304579 (program): a(n) = (n^2 + 1)*(n^2 + 2).
  • 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) = 81n^2 - 69n + 24.
  • A304617 (program): a(n) = 324n^2 - 564n + 321 (n>=1).
  • A304618 (program): a(n) = 108n^2 - 228n + 114 (n>=2).
  • A304619 (program): a(n) = 324n^2 - 804n + 468 (n>=2).
  • A304656 (program): Decimal expansion of Pi*sqrt(3).
  • A304659 (program): a(n) = n(n + 1)(16*n - 1)/6.
  • A304723 (program): a(n) = 5^(n-1)*(3^n - 1)/2.
  • A304725 (program): a(n) = n^4 + 8n^3 + 20n^2 + 16*n + 2.
  • A304726 (program): a(n) = n^4 + 4*n^2 + 3.
  • A304809 (program): Solution (a(n)) of the complementary equation a(n) = b(2n) + b(4n) ; see Comments.
  • 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) = 3n^2 + 38n - 76 (n>=2).
  • A304834 (program): a(n) = 36n^2 - 8n - 2 (n >=1).
  • A304835 (program): a(n) = 108n^2 - 104n + 20 (n>=1).
  • A304836 (program): a(n) = 27n^2 - 51n + 24, n>=1.
  • A304837 (program): a(n) = 6(n - 1)(81*n - 104) for n >= 1.
  • A304838 (program): a(n) = 1944n^2 - 5016n + 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).
  • A304887 (program): Number of non-isomorphic blobs of weight n.
  • A304909 (program): Expansion of x * (d/dx) Product_ k>=0 1/(1 - x^(2^k)).
  • A304974 (program): Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 4 colors (sets).
  • A304993 (program): a(n) = n(n + 1)(7*n + 5)/6.
  • A304995 (program): Expansion of (1 + 6x + 6x^2 + 6x^3 + x^4 + 6x^5)/((1 - x)*(1 + x^4)).
  • A305029 (program): Period 10 sequence [ 0, 2, 2, 2, 2, 0, -2, -2, -2, -2, …] except a(0) = 1.
  • 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) = 378n^2 - 54n (n>=1).
  • A305071 (program): a(n) = 972n^2 - 270n (n>=1).
  • A305072 (program): a(n) = 144n^2 - 24n (n>=1).
  • A305073 (program): a(n) = 288n^2 - 96n (n>=1).
  • A305074 (program): a(n) = 20*n - 8 (n>=1).
  • A305075 (program): a(n) = 32*n - 24 (n>=1).
  • 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.
  • A305185 (program): a(n) minimizes the maximum norm of elements in a complete residue system of Eisenstein integers modulo n.
  • A305189 (program): a(n) = 12 + 3 + 45 + 6 + 78 + 9 + 1011 + 12 + … + (up to n).
  • A305258 (program): List of y-coordinates of a point moving in a smooth counterclockwise spiral rotated by Pi/4.
  • 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.
  • 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.
  • A305315 (program): a(n) = sqrt(5b(n)^2 - 4), with b(n) = A134493(n) = Fibonacci(6n+1), n >= 0.
  • A305316 (program): a(n) = sqrt(5b(n)^2 - 4) with b(n) = Fibonacci(6n+5) = A134497(n).
  • A305395 (program): Records in A073053.
  • A305396 (program): Records in A171797.
  • 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.
  • 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.
  • A305503 (program): Largest cardinality of subsets A of 0,1,…,n-1 with A + A > A - A .
  • 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.
  • 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.
  • 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).
  • 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): Filter sequence for a(odd prime) = constant sequences.
  • 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.
  • A305877 (program): Numbers in base 3 reversed.
  • 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.
  • A305989 (program): Numbers in binary reversed.
  • A305994 (program): a(n) = ((A000265(3*n + 1) + 1) mod 4)/2.
  • A306007 (program): Number of non-isomorphic intersecting antichains of weight n.
  • A306174 (program): a(n) = (prime(n)^6 - 1)/504.
  • 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!).
  • 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].
  • 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.
  • A306285 (program): Numbers congruent to 4 or 21 mod 26.
  • 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).
  • A306312 (program): Number of terms of the set of divisors of n that are not the product of any other two distinct divisors.
  • A306331 (program): Numbers congruent to 6 or 31 mod 38.
  • A306354 (program): a(n) = gcd(n, A101337(n)).
  • 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)).
  • A306376 (program): Sum of the 2 X 2 minors in the n X n Pascal matrix.
  • A306380 (program): Squares of the form 5*k^2 + 5.
  • 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.
  • A306411 (program): a(n) = phi(n^6) = n^5*phi(n).
  • A306412 (program): a(n) = phi(n^8) = n^7*phi(n).
  • A306447 (program): Number of (undirected) Hamiltonian cycles in the n-antiprism graph.
  • A306472 (program): a(n) = 37*27^n.
  • A306535 (program): Number of permutations p of [2n] having no index i with p(i)-i = n.
  • A306546 (program): Modified Collatz Map such that odd numbers are treated the same, but even numbers have all factors of 2 removed.
  • 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).
  • 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 kbinomial(4n+2,2*k)
  • A306672 (program): Partial sums of the even Lucas numbers (A014448).
  • A306675 (program): Number of permutations p of [2n] having at least one index i with p(i)-i = n.
  • A306683 (program): Integers k for which the base-phi representation of k does not include 1 or phi.
  • A306694 (program): a(n) is the denominator of log(A014963(n))/log(n) if n > 1 and a(1) = 1.
  • 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).
  • A306721 (program): a(n) = Sum_ k=0..n binomial(k, 7*(n-k)).
  • 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)).
  • A306764 (program): a(n) is a sequence of period 12: repeat [1, 1, 6, 2, 1, 3, 2, 2, 3, 1, 2, 6].
  • 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.
  • A306847 (program): a(n) = Sum_ k=0..floor(n/6) binomial(n,6*k).
  • A306852 (program): a(n) = Sum_ k=0..floor(n/7) binomial(n,7*k).
  • 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).
  • A306957 (program): a(n) = n!*binomial(10,n).
  • A307018 (program): Total number of parts of size 3 in the partitions of n into parts of size 2 and 3.
  • 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).
  • 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).
  • A307163 (program): Minimum number of intercalates in a diagonal Latin square of order n.
  • A307178 (program): Decimal expansion of coth(1/2).
  • A307182 (program): Crossing number of the n-crown graph (conjectured).
  • A307229 (program): Decimal expansion of (3*exp(1/2) - 1)/2.
  • A307253 (program): Number of triangles larger than size=1 in a matchstick-made hexagon with side length n.
  • A307268 (program): Partial sums of the Lucas numbers of the form L(3n+2) (A163063).
  • 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.
  • A307313 (program): a(n) is the denominator of n/2^(length of the binary representation of n).
  • 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!).
  • A307395 (program): Expansion of 1/((1 - x) * ((1 - x)^3 + x^3)).
  • A307421 (program): Dirichlet g.f.: zeta(s) * zeta(3s) / zeta(2s).
  • A307424 (program): Dirichlet g.f.: zeta(3s) / zeta(2s).
  • A307430 (program): Dirichlet g.f.: zeta(s) / zeta(4*s).
  • A307465 (program): Number of Catalan words of length n avoiding the pattern 110.
  • A307469 (program): a(n) = 2a(n-1) + 6a(n-2) for n >= 2, a(0) = 1, a(1) = 5.
  • 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.
  • A307513 (program): Beatty sequence for 1/log(2).
  • 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).
  • A307559 (program): a(n) = floor(n/3)(n - floor(n/3))(n - floor(n/3) - 1).
  • 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.
  • A307621 (program): Number of cycles in the n-dipyramidal graph.
  • A307662 (program): Triangle T(i,j=1..i) read by rows which contain the naturally ordered divisors-or-ones of the row number i.
  • 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).
  • A307681 (program): Difference between the number of diagonals and the number of sides for a convex n-gon.
  • A307692 (program): g values of Triphosian primes.
  • A307702 (program): Clique covering number of the n-Sierpinski tetrahedron graph.
  • 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).
  • 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.
  • A307791 (program): Number of palindromic heptagonal numbers of length n whose index is also palindromic.
  • A307802 (program): Number of palindromic octagonal numbers of length n whose index is also palindromic.
  • A307808 (program): Number of palindromic nonagonal numbers of length n whose index is also palindromic.
  • 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.
  • A307872 (program): Sum of the smallest parts in the partitions of n into 3 parts.
  • A307897 (program): Dimensions of space of harmonic polynomials of each degree invariant under the icosahedral rotation group.
  • A307908 (program): a(n) is the least k such that p^k >= n for any prime factor p of n.
  • A307912 (program): a(n) = n - 1 - pi(2*n-1) + pi(n), where pi is the prime counting function.
  • A307921 (program): Number of (undirected) paths in the n-book graph.
  • A307939 (program): Number of (undirected) Hamiltonian paths in the n-dipyramidal graph.
  • 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.
  • A308044 (program): a(n) = 2prevprime(2n-1) - 2*n, where prevprime(n) is the largest prime < n.
  • A308046 (program): a(n) = 2nextprime(n - 1) - 2n, 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.
  • A308068 (program): Number of integer-sided triangles with perimeter n whose longest side length is even.
  • A308084 (program): a(n) = n(n-1)d(n)/4, where d(n)=A000005(n) is the number of divisors of n.
  • A308090 (program): a(n) = gcd(2^n + n!, 3^n + n!, n+1).
  • A308123 (program): Sum of the perimeters of all integer-sided isosceles triangles with perimeter n.
  • A308124 (program): a(n) = (2 + 7*4^n)/3.
  • 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.
  • A308167 (program): Number of integer-sided triangles with perimeter n and sides a, b, and c such that a <= b <= c and a b.
  • 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 .
  • A308196 (program): Partial sums of A063808.
  • 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.
  • A308266 (program): Sum of the middle parts in the partitions of n into 3 parts.
  • A308287 (program): Length 20 arithmetic progression of primes (PAP-20).
  • 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).
  • A308358 (program): Beatty sequence for sqrt(3)/4.
  • A308375 (program): Digital sum of composite numbers.
  • 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.
  • A308422 (program): a(n) = n^2 if n odd, 3*n^2/4 if n even.
  • 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.
  • A308495 (program): a(n) is the position of the first occurrence of prime(n) in A027748.
  • 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)).
  • A308579 (program): a(n) = (92^n - 6n - 10)/2.
  • A308580 (program): a(n) = 3*2^n + n^2 - n.
  • A308585 (program): a(n) = 2^(n + 3) - 10*n - 6.
  • 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.
  • 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.
  • A308632 (program): Largest aggressor for the maximum number of peaceable coexisting queens as given in A250000.
  • A308663 (program): Partial sums of A097805.
  • 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).
  • 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.
  • A308733 (program): Sum of the smallest parts of the partitions of n into 4 parts.
  • 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).
  • A308775 (program): Sum of all the parts in the partitions of n into 4 parts.
  • A308807 (program): a(n) = 4*5^(n-1) + n.
  • A308814 (program): a(n) = Sum_ d n n^(d-1).
  • A308822 (program): Sum of all the parts in the partitions of n into 5 parts.
  • A308876 (program): Expansion of e.g.f. exp(x)(1 - x)/(1 - 2x).
  • A308901 (program): Lexicographically earliest overlap-free binary sequence.
  • A309057 (program): a(0) = 1; a(2n) = 3a(n), a(2*n+1) = a(n).
  • A309074 (program): a(0) = 1; a(2n) = 4a(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.
  • A309093 (program): The analog of A309077(n), but allowing fractional powers.
  • A309097 (program): Number of partitions of n avoiding the partition (4,2,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.
  • 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) + …
  • A309127 (program): a(n) = n + 2^4 * floor(n/2^4) + 3^4 * floor(n/3^4) + 4^4 * floor(n/4^4) + …
  • 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).
  • 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.
  • A309231 (program): Column 3 of the array at A326662 see Comments.
  • A309250 (program): a(n) is the index of the binary string of a Post’s Correspondence Problem Encoding with index n.
  • A309255 (program): a(n) = n + 1 - Sum_ k=0..n (Stirling1(n,k) mod 2).
  • A309294 (program): (1/2) times the sum of the elements of all subsets of [n] whose sum is divisible by two.
  • A309307 (program): Number of unitary divisors of n (excluding 1).
  • A309315 (program): Number of 5-colorings of an n-wheel graph.
  • 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.
  • 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.
  • A309372 (program): a(n) = n^2 - n^3 + n^4.
  • A309398 (program): a(n) is the nearest integer to log(log(10^n)).
  • A309490 (program): Total number of adjacent node merge operations to turn a circular list of size n to a node.
  • 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.
  • A309574 (program): n-th prime minus its ternary (base 3) reversal.
  • A309579 (program): Maximum principal ratio of a strongly connected digraph on n nodes.
  • A309649 (program): Sieved recursive primeth recurrence (see Comments for precise definition).
  • A309674 (program): a(1) = 1, a(n) = hamming_weight(Sum_ k=1..n-1 a(k) ) for n>=2.
  • A309678 (program): G.f. A(x) satisfies: A(x) = A(x^4) / (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.
  • A309689 (program): Number of even parts appearing among the second largest parts of the partitions of n into 3 parts.
  • 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.
  • A309731 (program): Expansion of Sum_ k>=1 k * x^k/(1 - x^k)^3.
  • A309758 (program): Numbers that are sums of consecutive powers of 3.
  • A309761 (program): Numbers that are sums of consecutive powers of 10.
  • A309779 (program): Squares that can be expressed as the sum of two positive squares but not as the sum of three positive squares.
  • A309805 (program): Maximum number of nonattacking kings placeable on a hexagonal board with edge-length n in Glinski’s hexagonal chess.
  • A309809 (program): a(n) is the concatenation of n and 2n+1.
  • 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.
  • 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.
  • A309873 (program): Period-doubling turn sequence, +1 when the 2-adic valuation of n is even or -1 when odd.
  • 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.
  • A309907 (program): a(n) is the square of the number consisting of one 1 and n 3’s: (133…3)^2.
  • A309945 (program): a(n) = floor(n - sqrt(2*n-1)).
  • A309953 (program): Product of digits of (n written in base 3).
  • A309954 (program): Product of digits of (n written in base 4).
  • A309970 (program): Period 12: repeat [1, 1, 0, 0, -1, -1, -1, -1, 0, 0, 1, 1].
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • A316224 (program): a(n) = n(2n + 1)(4n + 1).
  • 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.)
  • 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.
  • A316316 (program): Coordination sequence for tetravalent 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)(2i-1): 1<=i<=n).
  • A316330 (program): a(n) = A000085(4*n)/2^n.
  • 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.
  • A316355 (program): 2k-1 appears 2k times after 2k-2 appears once.
  • A316357 (program): Partial sums of A316316.
  • A316386 (program): Binomial transform of [0, 1, 2, -3, -4, 5, 6, -7, -8, …].
  • A316457 (program): Expansion of x(31 + 326x + 336x^2 + 26x^3 + x^4) / (1 - x)^6.
  • A316458 (program): Expansion of 60x(1 + 4*x + x^2) / (1 - x)^5.
  • A316459 (program): Expansion of 30x(1 + x) / (1 - x)^4.
  • A316466 (program): a(n) = 2n(7*n - 3).
  • A316533 (program): a(n) is the Sprague-Grundy value of the Node-Kayles game played on the generalized Petersen graph P(n,2).
  • A316562 (program): Koechel number for the works of W. A. Mozart rounded from age 11.
  • 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
  • A316626 (program): a(1)=a(2)=a(3)=1; a(n) = a(n-2a(n-1))+a(n-1-2a(n-2)) for n > 3.
  • A316631 (program): Expansion of A(x) = x(1+3x^2+x^3+3*x^4+x^6)/(1-x^4)^2.
  • A316669 (program): Squares visited by queen 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.
  • A316708 (program): Bisection of the odd-indexed Pell numbers A001653: part 1.
  • A316709 (program): Bisection of the odd-indexed Pell numbers A001853: part 2.
  • A316724 (program): Generalized 26-gonal (or icosihexagonal) numbers: m(12m - 11) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316725 (program): Generalized 27-gonal (or icosiheptagonal) numbers: m(25m - 23)/2 with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316729 (program): Generalized 30-gonal (or triacontagonal) numbers: m(14m - 13) with m = 0, +1, -1, +2, -2, +3, -3, …
  • A316742 (program): Stepping through the Mersenne sequence (A000225) one step back, two steps forward.
  • A316777 (program): a(n) = Sum_ k=1..n (k!)^5.
  • 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.
  • A316832 (program): In A316831, replace 2’s and 3’s with 0’s.
  • A316843 (program): Column 1 of table A316841.
  • 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.
  • 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.
  • A316964 (program): Same as A316669, 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.
  • A317095 (program): a(n) = 40*n.
  • A317107 (program): Numbers missing from A317105.
  • A317108 (program): Numbers missing from A317106.
  • A317137 (program): a(n) is the number of nonzero triangular numbers <= n-th prime.
  • A317163 (program): a(n) = 48277590120607451 + (n-1)*8440735245322380.
  • A317164 (program): a(n) = 55837783597462913 + (n-1)*13858932213216090.
  • A317186 (program): One of many square spiral sequences: a(n) = n^2 + n - floor((n-1)/2).
  • A317189 (program): A morphic sequence related to the ternary Thue-Morse sequence.
  • A317200 (program): G.f.: -x(2x^3+2x^2+x-2)/(x^4-2x+1).
  • A317203 (program): Fixed under the morphism 1 -> 132, 2 -> 1, 3 -> 3, starting with 31.
  • A317255 (program): a(n) = 149836681069944461 + (n-1)*1723457117682300.
  • A317259 (program): a(n) = 136926916457315893 + (n - 1)*9843204333812850.
  • A317297 (program): a(n) = (n - 1)(4n^2 - 8*n + 5).
  • A317298 (program): a(n) = (1/2)(1 + (-1)^n + 2n + 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.
  • 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.
  • 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.
  • A317335 (program): a(n) = A317332(n) - 8*n.
  • A317336 (program): a(n) = A317333(n) - 8*n.
  • A317404 (program): a(n) = 3n(2^n - 1).
  • A317405 (program): a(n) = n * A001353(n).
  • A317408 (program): a(n) = n * Fibonacci(2n).
  • A317439 (program): Numbers missing from A317437.
  • A317440 (program): Numbers missing from A317438.
  • A317451 (program): a(n) = (n*A003500(n) - A231896(n))/2.
  • A317483 (program): Circuit rank of the n-Bruhat graph.
  • A317527 (program): Number of edges in the n-alternating group graph.
  • A317542 (program): Formal inverse of the period-doubling sequence A096268.
  • A317551 (program): Fertility numbers.
  • 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).
  • A317614 (program): a(n) = (1/2)(n^3 + n(n mod 2)).
  • A317633 (program): Numbers congruent to 1, 7, 9 mod 10.
  • A317637 (program): a(n) = n(n+1)(n+3).
  • A317657 (program): Numbers congruent to 15, 75, 95 mod 100.
  • A317714 (program): Chessboard rectangles sequence (see Comments), also A037270 interleaved with A163102.
  • A317790 (program): a(n) = 2a(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.
  • 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.
  • A317914 (program): a(n) = 142099325379199423 + (n-1)*3691994023167450.
  • 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.
  • A317980 (program): a(n) = Product_ i=1..n floor(5*i/2).
  • A317983 (program): Expansion of 420x(1 + x)(1 + 10x + x^2) / (1 - x)^6.
  • A317984 (program): Expansion of 140x(1 + 4*x + x^2) / (1 - x)^5.
  • A318054 (program): a(n) = n(n + 1)(n^2 + n + 22)/24.
  • A318111 (program): Number of maximal 1-intersecting families of 2-sets of [n] = 1,2,…,n .
  • A318159 (program): Figurate numbers based on the small stellated dodecahedron: a(n) = n(21n^2 - 33*n + 14)/2.
  • A318162 (program): Number of compositions of 2n-1 into exactly 2n-1 nonnegative parts with largest part n.
  • A318236 (program): a(n) = (32^(4n+3) + 1)/5.
  • A318249 (program): a(n) = (n - 1)! * d(n), where d(n) = number of divisors of n (A000005).
  • A318274 (program): Triangle read by rows: T(n,k) = n for 0 < k < n and T(n,0) = T(n,n) = 1.
  • A318446 (program): Inverse Möbius transform of A005187: a(n) = Sum_ d n A005187(d).
  • 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).
  • A318457 (program): a(n) = n XOR A001065(n), where XOR is bitwise-xor (A003987) and A001065 = sum of proper divisors.
  • A318505 (program): Sum of divisors of n, up to, but not including the second largest of them A032742(n); a(1) = 0 by convention.
  • A318608 (program): Moebius function mu(n) defined for the Gaussian integers.
  • 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 ).
  • A318666 (program): a(n) = 2^ the 3-adic valuation of n .
  • 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.
  • A318755 (program): a(n) = Sum_ k=1..n tau(k)^3, where tau is A000005.
  • A318765 (program): a(n) = (n + 2)*(n^2 + n - 1).
  • A318778 (program): Number of different positions that a elementary sphinx can occupy in a sphinx of order n.
  • A318791 (program): Prime generating polynomial: a(n) = 9n^2 - 249n + 1763.
  • A318827 (program): a(n) = n - gcd(n - 1, phi(n)).
  • A318830 (program): a(n) = phi(n) - gcd(phi(n), n-1).
  • A318876 (program): Sum of divisors d of n for which 2*phi(d) > d.
  • 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].
  • 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.
  • 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.
  • 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.
  • A319006 (program): Sum of the next n positive integers repeated (A008619).
  • A319007 (program): Sum of the next n nonnegative integers repeated (A004526).
  • 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) = 123 + 456 + 789 + 101112 + 131415 + 161718 + … + (up to n).
  • A319054 (program): Maximum product of an aperiodic integer partition of n.
  • A319074 (program): a(n) is the sum of the first n nonnegative powers of the n-th prime.
  • 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.
  • A319089 (program): a(n) = tau(n)^3, where tau is A000005.
  • A319102 (program): Triangle read by rows: The k-th column has alternating blocks of k 1’s followed by k 0’s (see example).
  • 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).
  • A319127 (program): Crossing number of the complete bipartite graph K_ 6,n .
  • A319128 (program): Interleave n(3n - 2), 3*n^2 + n - 1, n=0,0,1,1, … .
  • 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.
  • A319170 (program): Triangular numbers of the form 2..21..1; n_times 2 followed with n_times 1; n >= 1.
  • A319200 (program): a(n) = -(A(n) - A(n-1)) where A(n) = A057597(n+1), for n >= 0.
  • A319210 (program): a(n) = phi(n^2 - 1)/2 where phi is A000010.
  • A319258 (program): a(n) = 1 + 23 + 4 + 56 + 7 + 89 + 10 + 1112 + … + (up to 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.
  • A319371 (program): Numbers k such that the characteristic polynomial of a wheel graph of k nodes has exactly one monomial with vanishing coefficient.
  • A319384 (program): a(n) = a(n-1) + 2a(n-2) - 2a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=5, a(2)=9, a(3)=21, a(4)=29.
  • A319390 (program): a(n) = a(n-1) + 2a(n-2) - 2a(n-3) - a(n-4) + a(n-5), a(0)=1, a(1)=2, a(2)=3, a(3)=6, a(4)=8.
  • A319410 (program): Twice A032741.
  • A319433 (program): Take Zeckendorf representation of n (A014417(n)), drop least significant bit, take inverse Zeckendorf representation.
  • A319451 (program): Numbers that are congruent to 0, 3, 6 mod 12; a(n) = 3floor(4n/3).
  • A319452 (program): Numbers that are congruent to 0, 3, 6, 10 mod 12.
  • 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).
  • A319556 (program): a(n) gives the alternating sum of length n, starting at n: n - (n+1) + (n+2) - … + (-1)^(n+1) * (2n-1).
  • 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 - 6n^2 + 11n - 3).
  • 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.
  • 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.
  • A319638 (program): Number of non-isomorphic weight-n antichains of distinct sets whose dual is also an antichain of distinct sets.
  • 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.
  • A319667 (program): Palindromes a(n) = (10^n + 1)*(10^(n+1) + 1).
  • A319691 (program): a(n) = 1 if n is either 1 or divisible only by primes congruent to 1 mod 3, 0 otherwise.
  • A319697 (program): Sum of even squarefree divisors of 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.
  • A319710 (program): a(n) = 1 if n is divisible by the square of its smallest prime factor, 0 otherwise.
  • A319795 (program): a(n) = n^(n+1)/(n-1)^n for n>1, rounded to nearest integer.
  • 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.
  • A319866 (program): a(n) = 21 + 43 + 65 + 87 + 109 + 1211 + … + (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.
  • A319924 (program): a(n) = A143565(2n,n) for n > 0, a(0) = 1.
  • A319930 (program): a(n) = (1/24)n(n - 1)(n - 3)(n - 14).
  • A319948 (program): a(n) = Product_ i=1..n floor(3*i/2).
  • A319949 (program): a(n) = Product_ i=1..n floor(4*i/3).
  • A319956 (program): Image of 3 under repeated application of the morphism 1 -> 1, 2 -> 22, 3 -> 312.
  • A319988 (program): a(n) = 1 if n is divisible by the square of its largest prime factor, 0 otherwise.
  • A319995 (program): Number of divisors of n of the form 6*k + 5.
  • A319998 (program): a(n) = Sum_ d n, d is even mu(n/d)*d, where mu(n) is Moebius function A008683.
  • 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.
  • 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.
  • A320042 (program): a(n) = a(floor(n/2)) + (-1)^(n*(n+1)/2) with a(1)=0.
  • A320065 (program): a(n) is the smallest integer i such that binomial(2i,i) > n.
  • A320106 (program): Möbius transform of A320107.
  • A320111 (program): Number of divisors d of n that are not of the form 4k+2.
  • A320226 (program): Number of integer partitions of n whose non-1 parts are all equal.
  • A320259 (program): Terms that are on the y-axis of the square spiral built with 2k, 2k+1, 2*k+1 for k >= 0.
  • A320281 (program): Terms that are on the positive x-axis of the square spiral built with 2k, 2k+1, 2*k+1 for k >= 0.
  • A320394 (program): Number of ones in binary expansion n^5.
  • 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.
  • A320453 (program): a(n) = (n^n + n*(-1)^n)/(n + 1).
  • A320469 (program): a(n) = 3a(n-1) + 10a(n-2), n >= 2; a(0)=1, a(1)=1.
  • A320524 (program): Number of chiral pairs of a row of n colors using 6 or fewer colors.
  • 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.
  • 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.
  • A320661 (program): a(n) = 2^(n+3) - 6*n - 7.
  • 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).
  • A320770 (program): a(n) = (-1)^floor(n/4) * 2^floor(n/2).
  • A320772 (program): Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.
  • 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 .
  • 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.
  • 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.
  • 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).
  • 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.
  • A320997 (program): An absolute lower bound on the number of components in perfect systems of difference sets (PSDS).
  • A321003 (program): a(n) = 2^n(43^n-1).
  • A321014 (program): Number of divisors of n which are greater than 3.
  • A321017 (program): a(n) = floor(pi(n)/2).
  • A321018 (program): a(n) = round(pi(n)/2).
  • A321069 (program): Greatest prime factor of n^3+2.
  • 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(3n) = 0, a(3n+2) = 3 - a(3n+1), a(9n+1) = 1, a(9n+7) = 2, a(9n+4) = 3 - a(3*n+1), for n >= 0.
  • A321102 (program): Sequence generated by: a(3n) = 1, a(3n+2) = 1 - a(3n+1), a(9n+1) = 1, a(9n+7) = 0, a(9n+4) = 1 - a(3*n+1), for n >= 0.
  • A321103 (program): Sequence generated by: a(3n) = 1, a(3n+2) = 2 - a(3n+1), a(9n+1) = 2, a(9n+7) = 0, a(9n+4) = 2 - a(3*n+1), for n >= 0.
  • A321104 (program): Sequence generated by: a(3n) = 1, a(3n+2) = 2 - a(3n+1), a(9n+1) = 0, a(9n+7) = 2, a(9n+4) = 2 - a(3*n+1), for n >= 0.
  • A321123 (program): a(n) = 2^n + 2n^2 + 2n + 1.
  • A321124 (program): a(n) = (4n^3 - 6n^2 + 14*n + 3)/3.
  • A321129 (program): Numerator of Sum_ k=1..n (ksin((Pik)/3))/sqrt(3).
  • A321131 (program): Values of m (mod 25), where A317905(m) = 1.
  • 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.
  • A321195 (program): Minimum number of monochromatic Schur triples over all 2-colorings of [n].
  • A321202 (program): Row sums of the irregular triangle A321201.
  • 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.
  • A321232 (program): Length of n-th term of A321225.
  • 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.
  • A321295 (program): a(n) = n * sigma_n(n).
  • 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.
  • 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.
  • A321358 (program): a(n) = (2*4^n + 7)/3.
  • A321383 (program): Numbers k such that the concatenation k21 is a square.
  • A321406 (program): Number of non-isomorphic self-dual set systems of weight n with no singletons.
  • A321421 (program): a(n) = 10*(4^n - 1)/3 + 1.
  • A321483 (program): a(n) = 7*2^n + (-1)^n.
  • A321499 (program): Numbers of the form (x - y)(x^2 - y^2) with x > y > 0.
  • A321501 (program): Numbers not of the form (x - y)(x^2 - y^2) with x > y > 0; complement of A321499.
  • A321531 (program): a(n) is the maximum number of distinct directions between n non-attacking rooks on an n X n chessboard.
  • A321573 (program): Row sums of A321624.
  • A321579 (program): Number of n-tuples of 4 elements excluding reverse duplicates and those consisting of repetitions of the same element only.
  • A321643 (program): a(n) = 5*2^n - (-1)^n.
  • A321672 (program): Number of chiral pairs of rows of length 5 using up to n colors.
  • A321773 (program): Number of compositions of n into parts with distinct multiplicities and with exactly three parts.
  • A321789 (program): Factorials of terms of Pascal’s triangle by row.
  • 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.
  • A321875 (program): a(n) = Sum_ d n d*d!.
  • 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)).
  • A321986 (program): Number of integer pairs (x,y) with x+y < 3n/4, x-y < 3n/4 and -x/2 < y < 2*x.
  • A321999 (program): Sum of digits of n minus the number of digits of n.
  • A322008 (program): 1/(1 - Integral_ x=0..1 x^(x^n) dx), rounded to the nearest integer.
  • 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))).
  • 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.
  • A322039 (program): Expansion of (1 + x)^2 / ((1 - x)^2(1 + 2x)^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.
  • 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.
  • 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.
  • A322116 (program): Main diagonal of triangle A321600; a(n) = A321600(n,n-1) for n >= 1.
  • A322159 (program): Decimal expansion of 1 - 1/sqrt(5).
  • A322171 (program): Expansion of x(3 + 5x + x^2 + x^3)/((1 - x)^2*(1 + x^2)).
  • 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) = (5n)!/(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.
  • A322307 (program): Number of multisets in the swell of the n-th multiset multisystem.
  • A322327 (program): a(n) = A005361(n) * A034444(n) for n > 0.
  • A322361 (program): a(n) = gcd(n, A003961(n)), where A003961 is completely multiplicative with a(prime(k)) = prime(k+1).
  • A322382 (program): a(n) = p*a(n/p) + 1, where p is the smallest prime divisor of n; a(1)=0.
  • A322406 (program): a(n) = n + n*n^n.
  • A322417 (program): a(n) - 2*a(n-1) = period 2: repeat [3, 0] for n > 0, a(0)=5, a(1)=13.
  • 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.
  • A322489 (program): Numbers k such that k^k ends with 4.
  • A322490 (program): Numbers k such that k^k ends with 7.
  • 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.
  • 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.
  • A322582 (program): a(n) = n - A003958(n), where A003958 is fully multiplicative with a(p) = (p-1).
  • A322585 (program): a(n) = 1 if n is a product of primorial numbers (A002110), 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) = (4n^3 + 12n^2 - 4*n + 3)/3.
  • A322595 (program): a(n) = (n^3 + 9n + 14n + 9)/3.
  • A322597 (program): a(n) = (4n^3 - 6n^2 + 20*n + 3)/3.
  • A322598 (program): a(n) is the number of unlabeled rank-3 graded lattices with 3 coatoms and n atoms.
  • A322665 (program): Partial sums of A089451.
  • A322675 (program): a(n) = n * (4*n + 3)^2.
  • A322677 (program): a(n) = 16 * n * (n+1) * (2*n+1)^2.
  • A322745 (program): a(n) = n * (16n^2+20n+5)^2.
  • A322756 (program): Denominator of expected payoff in the “Guessing Card Colors” game with a 2n-card deck, using an optimal strategy.
  • A322783 (program): a(n) = 1 - n + (2^(n+2) - (-1)^n)/3.
  • 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.
  • A322830 (program): a(n) = 32n^3 + 48n^2 + 18*n + 1.
  • A322832 (program): Values x + y, where the ordered pairs (x,y) are sorted first by maximal coordinate and then lexicographically.
  • A322844 (program): a(n) = (1/12)n^2(3(1 + n^2) - 2(2 + n^2)*(n mod 2)).
  • A322925 (program): Expansion of x(1 + 2x + 10x^2)/((1 - x^2)(1 - 10*x^2)).
  • A322938 (program): a(n) = binomial(2*n + 2, n + 2) - 1.
  • A322940 (program): a(n) = [x^n] (4x^2 + x - 1)/(2x^2 + 3*x - 1).
  • 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.
  • A322982 (program): If n is a noncomposite, then a(n) = 2*n - 1, otherwise a(n) = A032742(n), the largest proper divisor of n.
  • A323048 (program): Sums of no more than two 5-smooth numbers.
  • 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.
  • 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).
  • A323152 (program): a(n) = 1 if sigma(n) is divisible by all proper divisors of n, 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.
  • A323162 (program): a(n) = 1 if both n and n-1 are composite, 0 otherwise.
  • A323170 (program): a(n) = 1 if (2*phi(n)) < n, 0 otherwise, where phi is Euler totient function (A000010).
  • A323178 (program): a(n) = 1 + 100*n^2 for n >= 0.
  • A323202 (program): Expansion of (1 - x) * (1 - x^3) / (1 - x^4) in powers of x.
  • 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.
  • A323218 (program): a(n) = (4n^3 + 30n^2 + 50*n)/3 + 1.
  • A323220 (program): a(n) = n(n + 5)(n + 7)*(n + 10)/24 + 1.
  • A323221 (program): a(n) = n(n + 5)(n + 7)/6 + 1.
  • A323223 (program): a(n) = [x^n] x/((1 - x)(1 - 4x)^(5/2)).
  • A323227 (program): a(n) = [x^n] (-x^4 + 2x^3 - x^2 + 2x - 1)/((x - 1)^2(2x - 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.
  • A323239 (program): a(n) = 1 if n is odd and squarefree, otherwise a(n) = 0.
  • A323294 (program): Number of 3-uniform hypergraphs spanning n labeled vertices where every two edges have two vertices in common.
  • A323305 (program): Number of divisors of the number of prime factors of n counted with multiplicity.
  • A323308 (program): The number of exponential semiproper divisors of n.
  • A323351 (program): Number of ways to fill a (not necessarily square) matrix with n zeros and ones.
  • A323397 (program): a(n) = (4^n + 15*n - 1)/9
  • A323466 (program): Number of terms in row n of A323465.
  • A323467 (program): Smallest number in row n of A323465.
  • A323547 (program): n-th digit in the base-2 expansion of 1/n.
  • A323591 (program): n-th digit in the base-3 expansion of 1/n.
  • 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).
  • A323614 (program): List of 7-powerful numbers (for the definition of k-powerful see A323395).
  • A323629 (program): List of 6-powerful numbers (for the definition of k-powerful see A323395).
  • A323639 (program): a(n) = 3*(10^n - 4)/9.
  • 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.
  • A323716 (program): a(n) = Product_ k=0..n (3^k + 1).
  • A323723 (program): a(n) = (-2 - (-1)^n(-2 + n) + n + 2n^3)/4.
  • A323724 (program): a(n) = n(2(n - 2)*n + (-1)^n + 3)/4.
  • A323735 (program): a(n) is the largest minimal distance of a binary LCD [n,2] code.
  • A323741 (program): a(n) = m-p where m = (2n+1)^2 and p is the largest prime < m.
  • A323824 (program): a(0) = 6; thereafter a(n) = 4*a(n-1) + 1.
  • A323847 (program): a(n) = (n-1)(n-2)(n^2+9*n+12)/24.
  • A323921 (program): a(n) = (4^(valuation(n, 4) + 1) - 1) / 3.
  • 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.
  • 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).
  • A324015 (program): Number of nonempty subsets of 1, …, n containing no two cyclically successive elements.
  • A324036 (program): Modified reduced Collatz map fs acting on positive odd integers.
  • A324050 (program): Numbers satisfying Korselt’s criterion: squarefree numbers n such that for every prime divisor p of n, p-1 divides n-1.
  • A324128 (program): a(n) = 2nFibonacci(n) + (-1)^n + 1.
  • A324129 (program): a(n) = n*Fibonacci(n) + ((-1)^n + 1)/2.
  • A324161 (program): Number of zerofree nonnegative integers <= n.
  • A324172 (program): Number of subsets of 1,…,n that cross their complement.
  • A324174 (program): Integers k such that 2*floor(sqrt(k)) divides k.
  • A324198 (program): a(n) = gcd(n, A276086(n)).
  • 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.
  • A324269 (program): a(n) = 311^(2n).
  • A324272 (program): a(n) = 213^(2n).
  • A324275 (program): Numbers k for which A324274(k) is 0, i.e., starting squares in A324274 that yield a path of infinite length.
  • A324293 (program): a(n) = A002487(sigma(n)).
  • A324337 (program): a(n) = A002487(A006068(n)).
  • 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)).
  • 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.
  • 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).
  • A324471 (program): a(n) = 10 mod n.
  • A324472 (program): a(n) = 1000 mod n.
  • A324476 (program): Packing numbers for n-tripods.
  • A324487 (program): a(n) = A001350(n)^3.
  • A324490 (program): A324487(3*n).
  • A324502 (program): a(n) = denominator of Sum_ d n (1/pod(d)) where pod(k) = the product of the divisors of k (A007955).
  • A324560 (program): Numbers > 1 where the minimum prime index is less than or equal to the number of prime factors counted with multiplicity.
  • A324580 (program): a(n) = n * A276086(n).
  • A324600 (program): a(n) = (k(n)*(k(n) + 1))/2 with k = A018252 (nonprime numbers), for n >= 1.
  • A324650 (program): a(n) = A000010(A276086(n)).
  • A324772 (program): The “Octanacci” sequence: Trajectory of 0 under the morphism 0-> 0,1,0 , 1-> 0 .
  • A324895 (program): Largest proper divisor of A276086(n); a(0) = 1.
  • 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).
  • A324908 (program): a(n) = 1 if n is an odd number which is not a square, 0 otherwise.
  • 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.
  • A324964 (program): a(n) = A000139(n) mod 2; Characteristic function of odd fibbinary numbers (A022341).
  • A324965 (program): Partial sums of A324964.
  • A324969 (program): Number of unlabeled rooted identity trees with n vertices whose non-leaf terminal subtrees are all different.
  • 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.
  • 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.
  • A325153 (program): A column of triangle A322220; a(n) = A322220(n,1) for n >= 1.
  • A325168 (program): Number of integer partitions of n with origin-to-boundary graph-distance equal to 2.
  • A325173 (program): Perfect squares of the form a + b^2 + c^3, where a,b,c are consecutive numbers.
  • 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.
  • A325226 (program): Number of prime factors of n that are less than the largest, counted with multiplicity.
  • A325282 (program): Maximum adjusted frequency depth among integer partitions of n.
  • 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.
  • 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.
  • A325339 (program): Number of divisors of n^3 that are <= n.
  • 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.
  • A325413 (program): Largest sum of the omega-sequence of an integer partition of n.
  • A325459 (program): Sum of numbers of nontrivial divisors (greater than 1 and less than k) of k for k = 1..n.
  • 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.
  • A325488 (program): Dimensions of space of harmonic polynomials of each degree invariant under the full icosahedral group.
  • A325517 (program): a(n) = n((2n + 1)(2n^2 + 2n + 3) - 3(-1)^n)/24.
  • A325636 (program): a(n) = gcd(2n, sigma(n)).
  • A325656 (program): a(n) = (1/24)n((4n + 3)(2n^2 + 1) - 3(-1)^n).
  • A325657 (program): a(n) = (1/2)(-1 + (-1)^n)(n-1) + n^2.
  • 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.
  • A325765 (program): Number of integer partitions of n with a unique consecutive subsequence summing to every positive integer from 1 to n.
  • A325838 (program): Product of divisors of n-th triangular number.
  • 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 that have hexadecimal representation of AAAAAAA…
  • A325937 (program): Expansion of Sum_ k>=1 (-1)^(k + 1) * x^(2*k) / (1 - x^k).
  • A325939 (program): Expansion of Sum_ k>=1 x^(2*k) / (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.
  • 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)).
  • A326041 (program): a(n) = sigma(A064989(n)).
  • 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.
  • A326055 (program): a(n) = n - the largest square that divides n .
  • A326058 (program): a(n) = n - the sum of square divisors of n .
  • A326061 (program): Sum of all other divisors of n except the largest proper divisor. a(1) = 0 by convention.
  • A326065 (program): Sum of divisors of the largest proper divisor of n: a(n) = sigma(A032742(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.
  • 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.
  • 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.
  • A326128 (program): a(n) = n - A007913(n), where A007913 gives the squarefree part of n.
  • A326178 (program): Number of subsets of 1..n whose product is equal to their sum.
  • A326186 (program): a(n) = n - A057521(n), where A057521 gives the powerful part of n.
  • A326194 (program): Number of iterations of x -> A009194(x) needed to reach a fixed point when starting from x = n, where A009194(x) = gcd(x, sigma(x)).
  • A326195 (program): Number of iterations of x -> A009195(x) needed to reach 1 when starting from x = n, where A009195(x) = gcd(x, phi(x)).
  • A326247 (program): Number of labeled n-vertex 2-edge multigraphs that are neither crossing nor nesting.
  • A326278 (program): Number of n-vertex, 2-edge multigraphs that are not nesting. Number of n-vertex, 2-edge multigraphs that are not crossing.
  • A326289 (program): a(0) = 0, a(n) = 2^binomial(n,2) - 2^(n - 1).
  • A326299 (program): a(n) = floor(n*log_2(n)).
  • A326300 (program): Steinhaus sums.
  • A326354 (program): a(n) is the number of fractions reduced to lowest terms with numerator and denominator less than or equal to n in absolute value.
  • A326367 (program): Number of tilings of an equilateral triangle of side length n with unit triangles (of side length 1) and exactly two unit “lozenges” or “diamonds” (also of side length 1).
  • A326394 (program): Expansion of Sum_ k>=1 x^k * (1 + x^(2k)) / (1 - x^(3k)).
  • A326395 (program): Expansion of Sum_ k>=1 x^(2k) * (1 + x^k) / (1 - x^(3k)).
  • A326398 (program): a(n) is the smallest k > 0 such that the concatenation prime(n)k is composite.
  • A326399 (program): Expansion of Sum_ k>=1 k * x^k / (1 - x^(3*k)).
  • A326400 (program): Expansion of Sum_ k>=1 k * x^(2k) / (1 - x^(3k)).
  • A326422 (program): Numbers k such that A000045(k) mod 5 is prime.
  • A326494 (program): Number of subsets of 1..n containing all differences and quotients of pairs of distinct elements.
  • A326501 (program): a(n) = Sum_ k=0..n (-k)^k.
  • A326577 (program): a(n) = (2n - 1) / A326478(2n - 1).
  • A326618 (program): a(n) = n^18 + n^9 + 1.
  • A326657 (program): a(n) = 4*floor(n/2) + ceiling((n-1)^2/2).
  • A326658 (program): a(n) = 6*floor(n/2) + ceiling((n-1)^2/2).
  • A326663 (program): Column 3 of the array at A309157; see Comments.
  • A326664 (program): Column 3 of the array at A326661 see Comments.
  • A326690 (program): Denominator of the fraction (Sum_ prime p n 1/p - 1/n).
  • A326691 (program): a(n) = n/denominator(Sum_ prime p n 1/p - 1/n).
  • A326714 (program): a(n) = binomial(n,2) + (2-adic valuation of n).
  • A326725 (program): a(n) = (1/2)n(5*n - 7); row 5 of A326728.
  • A326730 (program): Number of iterations of A326729(x) starting at x = n to reach 0.
  • A326781 (program): No position of a 1 in the reversed binary expansion of n is a power of 2.
  • A326790 (program): The rank of the group of functions on the units of Z/nZ generated by the functions f(u) = u*k mod n.
  • A326812 (program): Expansion of Sum_ k>=1 (2^k - 1) * x^(2^k - 1) / (1 - x^(2^k - 1)).
  • A326822 (program): T(n, k) = k^0 if k = 1 else 0^n. Triangle read by rows, T(n, k) for 0 <= k <= n.
  • A326937 (program): Dirichlet g.f.: (2^s - 1) / (zeta(s-1) * (2^s - 2)).
  • A326987 (program): Number of nonpowers of 2 dividing n.
  • A326990 (program): Sum of odd divisors of n that are greater than 1.
  • A327021 (program): a(n) = (2*n-1)! / 2^(n-1) if n > 0 and a(0) = 1.
  • A327032 (program): a(n) = T(n, 4) with T(n, k) = Sum_ d k phi(d)*binomial(n - 1 + k/d, k/d).
  • A327142 (program): a(n) is the number of different sizes of integer-sided rectangles which can be placed inside an n X n square and with length greater than n.
  • A327180 (program): a(n) = [(2n+1)r] - [(n+1)r] - [nr], where [ ] = floor and r = sqrt(3).
  • A327247 (program): Number of odd prime powers <= n (with exponents > 0).
  • A327253 (program): a(n) = floor(2nr) - 2floor(nr), where r = sqrt(6).
  • A327256 (program): a(n) = floor(2nr) - 2floor(nr), where r = sqrt(8).
  • A327310 (program): a(n) = floor(3nr) - 3floor(nr), where r = sqrt(8).
  • A327319 (program): a(n) = binomial(n, 2) + 6*binomial(n, 4).
  • A327326 (program): a(n) = A006218(n) - A005187(n).
  • A327329 (program): Twice the sum of all divisors of all positive integers <= n.
  • A327374 (program): BII-numbers of set-systems with vertex-connectivity 2.
  • A327376 (program): BII-numbers of set-systems with vertex-connectivity 3.
  • A327411 (program): a(n) = multinomial(2*n+3; 3, 2, 2, …, 2) (n times ‘2’).
  • A327440 (program): a(n) = floor(3*n/10).
  • A327470 (program): Maximum valency of the central line in a certain smooth 2D-polarized K3-surface in P^ n+1 .
  • A327474 (program): Number of distinct means of subsets of 1..n , where has mean 0.
  • A327491 (program): a(0) = 0. If 4 divides n then a(n) = valuation(n, 2) else a(n) = (n mod 2) + 1.
  • A327492 (program): Partial sums of A327491.
  • A327493 (program): a(n) = 2^A327492(n).
  • A327496 (program): a(n) = a(n - 1) * 4^r where r = valuation(n, 2) if 4 divides n else r = (n mod 2) + 1; a(0) = 1. The denominators of A327495.
  • A327503 (program): Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1 or not a perfect power (A327501, A327502).
  • A327517 (program): Number of factorizations of n that are empty or have at least two factors, all of which are > 1 and pairwise coprime.
  • A327564 (program): If n = Product (p_j^k_j) then a(n) = Product ((p_j + 1)^(k_j - 1)).
  • A327565 (program): Number of transfers of marbles between two sets until the first repetition.
  • A327570 (program): a(n) = n*phi(n)^2, phi = A000010.
  • A327582 (program): a(n) = (17 * 7^(2*n+1) + 1)/24. Sequence related to the properties of the partition function A000041 modulo a power of 7.
  • A327606 (program): Expansion of e.g.f. exp(x)(1-x)x/(1-2*x)^2.
  • A327625 (program): Expansion of Sum_ k>=0 x^(3^k) / (1 - x^(3^k))^2.
  • A327666 (program): a(n) = Sum_ k = 1..n (-1)^(Omega(k) - omega(k)), where Omega(k) counts prime factors of k with multiplicity and omega(k) counts distinct prime factors.
  • A327667 (program): a(n) is the least base >= 2 where n is the least number with its sum of digits.
  • A327672 (program): a(n) = Sum_ k=0..n ceiling(sqrt(k)).
  • A327704 (program): The minimal size of a partition lambda of n such that every partition of n with at most 4 parts can be obtained by coalescing the parts of lambda.
  • A327705 (program): The minimal size of a partition lambda of n such that every partition of n with at most 5 parts can be obtained by coalescing the parts of lambda.
  • A327706 (program): The minimal size of a partition lambda of n such that every partition of n with at most 6 parts can be obtained by coalescing the parts of lambda.
  • A327707 (program): The minimal size of a partition lambda of n such that every partition of n with at most 7 parts can be obtained by coalescing the parts of lambda.
  • A327708 (program): The minimal size of a partition lambda of n such that every partition of n with at most 8 parts can be obtained by coalescing the parts of lambda.
  • A327721 (program): Dimension of quantum lens space needed for non-uniqueness.
  • A327737 (program): a(n) is the sum of the lengths of the base-b expansions of n for all b with 1 <= b <= n.
  • A327760 (program): Primes in Rob Gahan’s arithmetic progression of 27 primes.
  • A327767 (program): Period 2: repeat [1, -2].
  • A327770 (program): a(n) = (23 * 7^(2*n) + 1)/24. Sequence related to the properties of the partition function A000041 modulo a power of 7.
  • A327836 (program): Least k > 0 such that n^k == 1 (mod (n+1)^(n+1)).
  • A327859 (program): a(n) = A276086(A003415(n)), where A003415 is the arithmetic derivative and A276086 converts digits of primorial base representation to exponents in prime factorization.
  • A327860 (program): a(n) = A003415(A276086(n)).
  • A327866 (program): a(n) = 1 if arithmetic derivative of n is square, 0 otherwise. Cf. A003415.
  • A327882 (program): a(n) = n(2(n-1))! for n > 0, a(0) = 1.
  • A327896 (program): a(n) is the minimum number of tiles needed for constructing a polyiamond with n holes.
  • A327917 (program): Triangle T read by rows: T(k, n) = A(k-n, k) with the array A(k, n) = F(2k+n) = A000045(2k+n), for k >= 0 and n >= 0.
  • A327926 (program): a(n) = 99^n.
  • A327936 (program): Multiplicative with a(p^e) = p if e >= p, otherwise 1.
  • A327938 (program): Multiplicative with a(p^e) = p^(e mod p).
  • A327939 (program): Multiplicative with a(p^e) = p^(e-(e mod p)).
  • A327998 (program): a(n) = (n!/floor(n/2)!^2)^2.
  • A327999 (program): a(n) = Sum_ k=0..2n (k!(2n - k)!)/(floor(k/2)!floor((2n - k)/2)!)^2.
  • A328005 (program): Number of distinct coefficients in functional composition of 1 + x + … + x^(n-1) with itself.
  • A328012 (program): Numbers whose binary representations start and end with 1 and contain an even number of zeros between.
  • A328034 (program): a(n) = 3n minus the largest power of 2 not exceeding 3n.
  • A328082 (program): Triangle read by rows: columns are Fibonacci numbers F_ 2i+1 shifted downwards.
  • A328085 (program): Column sums of triangle A328084.
  • A328152 (program): a(n) is the number of squares of side length greater than 1 having vertices at the points of an n X n grid of dots.
  • A328154 (program): G.f. A(x) satisfies: A(x) = A(x^2) + x / (1 + x)^2.
  • A328184 (program): Denominator of time taken for a vertex of a rolling regular n-sided polygon to reach the ground.
  • A328185 (program): Numerators associated with A328184.
  • A328259 (program): a(n) = n * sigma_2(n).
  • A328260 (program): a(n) = n * omega(n).
  • A328263 (program): a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1.
  • A328283 (program): The maximum number m such that m white, m black and m red queens can coexist on an n X n chessboard without attacking each other.
  • A328284 (program): An extension of the Jacobsthal numbers: 0, 0, 1, followed by A001045.
  • A328308 (program): a(n) = 1 if k-th arithmetic derivative of n is zero for some k, otherwise 0.
  • A328309 (program): a(n) tells how many numbers there are in range 0..n such that their k-th arithmetic derivative is zero for some k >= 0.
  • A328317 (program): Smallest prime not dividing A328316(n), with a(0) = 1 by convention; Equally, for n > 0, smallest prime dividing A328316(1+n).
  • A328332 (program): Expansion of (1 + 4x - 5x^2 + 10x^3) / ((1 - x) * (1 - 10x^2)).
  • A328333 (program): Expansion of (1 + 4x - 6x^2) / ((1 - x) * (1 - 10*x^2)).
  • A328337 (program): The number whose binary indices are the nontrivial divisors of n (greater than 1 and less than n).
  • A328348 (program): Let S be any integer in the range 3 <= S <= 17. Sequence has the property that a(n)*S is the sum of all positive integers whose decimal expansion has <= n digits and contains at most two distinct nonzero digits p and q such that p+q=S.
  • A328350 (program): Let S be any integer in the range 6 <= S <= 24. Sequence has the property that a(n)*S is the sum of all positive integers whose decimal expansion has <= n digits and contains at most three distinct nonzero digits d1, d2, d3 such that d1+d2+d3 = S.
  • A328351 (program): Let S be any integer in the range 10 <= S <= 30. Sequence has the property that a(n)*S is the sum of all positive integers whose decimal expansion has <= n digits and contains at most four distinct nonzero digits d1, d2, d3 and d4 such that d1+d2+d3+d4=S.
  • A328352 (program): Similar to A328350, but for 5 digits rather then 3.
  • A328353 (program): a(n)*S is the sum of all positive integers whose decimal expansion is up to n digits and uses six distinct nonzero digits d1,d2,d3,d4,d5,d6 such that d1+d2+d3+d4+d5+d6=S.
  • A328354 (program): a(n)*S is the sum of all positive integers whose decimal expansion is up to n digits and uses seven distinct nonzero digits d1,d2,d3,d4,d5,d6,d7 such that d1+d2+d3+d4+d5+d6+d7=S.
  • A328355 (program): Let S be any integer in the range 36 <= S <= 44. Sequence has the property that a(n)*S is the sum of all positive integers whose decimal expansion has <= n digits and uses eight distinct nonzero digits d1,d2,d3,d4,d5,d6,d7,d8 such that d1+d2+d3+d4+d5+d6+d7+d8=S.
  • A328356 (program): a(n) is the sum of all positive integers whose decimal expansion is up to n digits and does not contain the 0 digit.
  • A328366 (program): a(n) is the surface area of the stepped pyramid with n levels described in A245092.
  • A328407 (program): G.f. A(x) satisfies: A(x) = A(x^2) + x * (1 + x) / (1 - x)^3.
  • A328408 (program): G.f. A(x) satisfies: A(x) = A(x^2) + x * (1 + 4*x + x^2) / (1 - x)^4.
  • A328478 (program): Divide n by the largest primorial that divides it and repeat until a fixed point is reached; a(n) is the fixed point.
  • A328479 (program): a(n) = n/A328478(n), where A328478(n) is obtained by repeatedly dividing n by the largest primorial that divides it until a fixed point is reached.
  • A328563 (program): Nonsquarefree unitary weird numbers that are also weird numbers.
  • A328572 (program): Primorial base expansion of n converted into its prime product form, but with 1 subtracted from all nonzero digits: a(n) = A003557(A276086(n)).
  • A328615 (program): Number of digits larger than 1 in primorial base expansion of n.
  • A328659 (program): Partial sums of A035100: number of binary digits of the primes.
  • A328683 (program): Positive integers that are equal to 99…99 (repdigit with n digits 9) times the sum of their digits.
  • A328778 (program): Number of indecomposable closed walks of length 2n along the edges of a cube based at a vertex.
  • A328791 (program): Triangular numbers of the form k^2 + 3.
  • A328823 (program): a(n) is the least prime factor of A000096(n) = n*(n+3)/2.
  • A328824 (program): Numerators of A113405(-n) (see the comment for details).
  • A328827 (program): a(n) is the largest prime factor of n + n(n+1)/2 = n(n+3)/2.
  • A328865 (program): The first repeating term in the trajectory of n under iterations of A329623, or -1 if no such terms exists.
  • A328881 (program): a(n+3) = 2^n - a(n), a(0)=a(2)=1, a(1)=0 for n >= 0.
  • A328882 (program): a(n) = n - 2^(sum of digits of n).
  • A328890 (program): Number of acyclic edge covers of the complete bipartite graph K_ n,2 .
  • A328915 (program): If n = Product (p_j^k_j) then a(n) = Product (nextprime(p_j)), where nextprime = A151800.
  • A328943 (program): a(n) = 2 + (n mod 4).
  • A328950 (program): Numerators for the “Minimum-Redundancy Code” card problem.
  • A328979 (program): Trajectory of 0 under repeated application of the morphism 0 -> 0010, 1 -> 1010.
  • A328981 (program): Indicator function of numbers whose binary representation ends in an even positive number of 0’s.
  • A328982 (program): Sorted list of the numbers of the form 5m+2 (m>=0) together with numbers of the form 5m-2+eps (m>=1), where eps = 1 if the binary expansion of m ends in an odd number of 0’s and is otherwise 0.
  • A328984 (program): If n is even, a(n) = floor((5t+1)/2) where t=n/2; if n == 1 (mod 4) then a(n) = 10t+1 where t = (n-1)/4; and if n == 3 (mod 4) then a(n) = 10t+7 where t = (n-3)/4.
  • A328987 (program): The sequence C(n) defined in the comments (A and B smallest missing numbers, offset 0).
  • A328990 (program): a(n) = (3*b(n) + b(n-1) + 1)/2, where b = A005409.
  • A328994 (program): a(n) = n^2(1+n)(1+n^2)/4.
  • A328995 (program): Dirichlet g.f. = Product_ primes p == 1 mod 3 (1+p^(-s))/(1-p^(-s)).
  • A329005 (program): a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.
  • A329014 (program): a(n) = p(0,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(6) as in A327323.
  • A329018 (program): a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3/2) as in A328644.
  • A329114 (program): a(n) = floor(A026532(n)/5).
  • A329115 (program): a(n) = floor(A026549(n)/5).
  • A329116 (program): Successively count to (-1)^(n+1)*n (n = 0, 1, 2, … ).
  • A329193 (program): a(n) = floor(log_2(n^3)) = floor(3 log_2(n))
  • A329194 (program): a(n) = floor(log_3(n^2)) = floor(2 log_3(n))
  • A329195 (program): a(n) = floor(log_5(n^2)) = floor(2 log_5(n))
  • A329199 (program): a(n) = round(log_3(n)).
  • A329202 (program): a(n) = floor(2*log_2(n)) = floor(log_2(n^2)).
  • A329244 (program): Sum of every third term of the Padovan sequence A000931.
  • A329277 (program): a(n) is the fixed point reached by iterating Euler’s gradus function A275314 starting at n.
  • A329279 (program): Number of distinct tilings of a 2n X 2n square with 1 x n polyominoes.
  • A329320 (program): a(n) = Sum_ k=0..floor(log_2(n)) 1 - A035263(1 + floor(n/2^k)).
  • A329376 (program): Multiplicative with a(p^e) = p when e == 2, otherwise a(p^e) = 1.
  • A329379 (program): a(n) = n/A093411(n), where A093411(n) is obtained by repeatedly dividing n by the largest factorial that divides it until an odd number is reached.
  • A329402 (program): Number of rectangles (w X h, w <= h) with integer side lengths w and h having area = n * perimeter.
  • A329404 (program): Interleave 2n(3n-1), (2n+1)(6n+1) for n >= 0.
  • A329422 (program): Maximum length of a binary n-similar word.
  • A329480 (program): a(n) = (1 - A075677(n))/6 if 6 (A075677(n)-1) or a(n) = (A075677(n) + 1)/6 if 6 (A075677(n)+1).
  • A329482 (program): Interleave 1 - n + 3n^2, 1 + 3n*(1+n) for n >= 0.
  • A329486 (program): a(n) = 3*A006519(n)/2 + n/2 where A006519(n) is the highest power of 2 dividing n.
  • A329494 (program): Numerator of 2(2n+1)/(n+2).
  • A329502 (program): G.f. = (1+x)(1+2x)/(1-x).
  • A329503 (program): G.f. = (1+x)(1+2x+2*x^2)/(1-x).
  • A329505 (program): Expansion of (1 + x)(1 + 2x - x^2) / (1 - x).
  • A329506 (program): Expansion of (1 + x)(1 + 2x + 2x^2 - 2x^3) / (1 - x).
  • A329507 (program): Expansion of (1 + x)(1 + 2x + 2x^2 + 2x^3 - 3*x^4) / (1 - x).
  • A329509 (program): Expansion of (1 + x)*(1 + x + x^2 - x^3) / (1 - x).
  • A329510 (program): Expansion of (1 + x)(1 + x + x^2)(1 + x^2 - x^3) / (1 - x).
  • A329513 (program): G.f. = (1+x)^2(1+2x^2-x^3)/(1-x).
  • A329516 (program): G.f. = (x^4 - x^3 - 3x^2 - 2x - 1)/(x - 1).
  • A329523 (program): a(n) = n * (binomial(n + 1, 3) + 1).
  • A329530 (program): a(n) = n * (7*binomial(n, 2) + 1).
  • A329533 (program): First differences of A051924, or second differences of Central binomial coefficients A000984.
  • A329547 (program): Number of natural numbers k <= n such that k^k is a square.
  • A329562 (program): a(n) = 2^(sum of digits of n).
  • A329583 (program): Numerators of 1 + n^2/4 + period 3: repeat [-1, 1, 1].
  • A329598 (program): Partial sums of the nontriangular numbers (A014132).
  • A329670 (program): Number of excursions of length n with Motzkin-steps allowing only consecutive steps UH and HD.
  • A329677 (program): Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UH, HD, and DH.
  • A329678 (program): Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UD and DH.
  • A329679 (program): Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UH, UD, HD and DH.
  • A329680 (program): Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UH, HD and DU.
  • A329682 (program): Number of excursions of length n with Motzkin-steps forbidding all consecutive steps of length 2 except UH, UD, HU and DD.
  • A329683 (program): Number of excursions of length n with Motzkin-steps forbidding all consecutive steps of length 2 except UH, HH and HD.
  • A329684 (program): Number of excursions of length n with Motzkin-steps forbidding all consecutive steps of length 2 except UD and HH.
  • A329687 (program): Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UU, UD, HH and DH.
  • A329696 (program): Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HU, HD and DH.
  • A329697 (program): a(n) is the number of iterations needed to reach a power of 2 starting at n and using the map k -> k-(k/p), where p is the largest prime factor of k.
  • A329723 (program): Coefficients of expansion of (1-2x^3)/(1-x-x^2) in powers of x.
  • A329728 (program): Partial sums of A092261.
  • A329753 (program): Doubly square pyramidal numbers.
  • A329754 (program): Doubly pentagonal pyramidal numbers.
  • A329774 (program): a(n) = n+1 for n <= 2; otherwise a(n) = 3*a(n-3)+1.
  • A329822 (program): The minimum weight of a Boolean function of algebraic degree at most n-3 whose support contains n linearly independent elements.
  • A329826 (program): Beatty sequence for (5+sqrt(17))/4.
  • A329827 (program): Beatty sequence for (5+sqrt(37))/6.
  • A329828 (program): Beatty sequence for (7+sqrt(37))/6.
  • A329829 (program): Beatty sequence for (2+sqrt(10))/3.
  • A329830 (program): Beatty sequence for (4+sqrt(10))/3.
  • A329831 (program): Beatty sequence for (7+sqrt(65))/8.
  • A329832 (program): Beatty sequence for (9+sqrt(65))/8.
  • A329833 (program): Beatty sequence for (5+sqrt(73))/8.
  • A329834 (program): Beatty sequence for (11+sqrt(73))/8.
  • A329835 (program): Beatty sequence for (9+sqrt(101))/10.
  • A329836 (program): Beatty sequence for (11+sqrt(101))/10.
  • A329837 (program): Beatty sequence for (4+sqrt(26))/5.
  • A329838 (program): Beatty sequence for (6+sqrt(26))/5.
  • A329839 (program): Beatty sequence for (-1+sqrt(41))/4.
  • A329840 (program): Beatty sequence for (9+sqrt(41))/4.
  • A329841 (program): Beatty sequence for (7+sqrt(109))/10.
  • A329842 (program): Beatty sequence for (13+sqrt(109))/10.
  • A329843 (program): Beatty sequence for (1+sqrt(61))/6.
  • A329844 (program): Beatty sequence for (11+sqrt(61))/6.
  • A329845 (program): Beatty sequence for (3+sqrt(29))/5.
  • A329846 (program): Beatty sequence for (7+sqrt(29))/5.
  • A329847 (program): Beatty sequence for (3+sqrt(89))/8.
  • A329848 (program): Beatty sequence for (13+sqrt(89))/8.
  • A329923 (program): Beatty sequence for (2+sqrt(34))/5.
  • A329924 (program): Beatty sequence for (8+sqrt(34))/5.
  • A329925 (program): Beatty sequence for (1+sqrt(41))/5.
  • A329926 (program): Beatty sequence for (9+sqrt(41))/5.
  • A329928 (program): a(n) = (Pi/2)(2n+1)!binomial(2n+1, (2*n+1)/2).
  • A329938 (program): Beatty sequence for sinh x, where csch x + sech x = 1 .
  • A329939 (program): Beatty sequence for cosh x, where csch x + sech x = 1 .
  • A329952 (program): Numbers k such that binomial(k,3) is divisible by 8.
  • A329961 (program): Beatty sequence for 2 + sin x, where x = least positive solution of 1/(2 + sin x) + 1/(2 + cos x) = 1.
  • A329962 (program): Beatty sequence for 2 + cos x, where x = least positive solution of 1/(2 + sin x) + 1/(2 + cos x) = 1.
  • A329964 (program): a(n) = (n!/floor(1+n/2)!)^2.
  • A329974 (program): Beatty sequence for the real solution x of 1/x + 1/(1+x+x^2) = 1.
  • A329975 (program): Beatty sequence for 1 + x + x^2, where x is the real solution of 1/x + 1/(1+x+x^2) = 1.
  • A329977 (program): Beatty sequence for the number x satisfying 1/x + 1/(log x) = 1.
  • A329978 (program): Beatty sequence for log x, where 1/x + 1/(log x) = 1.
  • A329987 (program): Beatty sequence for the number x satisfying 1/x + 1/2^x = 1.
  • A329988 (program): Beatty sequence for 2^x, where 1/x + 1/2^x = 1.
  • A329990 (program): Beatty sequence for the number x satisfying 1/x + 1/3^x = 1.
  • A329991 (program): Beatty sequence for 3^x, where 1/x + 1/3^x = 1.
  • A329993 (program): Beatty sequence for x^2, where 1/x^2 + 1/2^x = 1.
  • A329994 (program): Beatty sequence for 2^x, where 1/x^2 + 1/2^x = 1.
  • A329996 (program): Beatty sequence for x^3, where 1/x^3 + 1/3^x = 1.
  • A329997 (program): Beatty sequence for 3^x, where 1/x^3 + 1/3^x = 1.
  • A329999 (program): Beatty sequence for sqrt(x-1), where 1/sqrt(x-1) + 1/sqrt(x+1) = 1.
  • A330000 (program): Beatty sequence for sqrt(x+1), where 1/sqrt(x-1) + 1/sqrt(x+1) = 1.
  • A330002 (program): Beatty sequence for x, where 1/x + 1/(x+1)^2 = 1.
  • A330003 (program): Beatty sequence for (x+1)^2, where 1/x + 1/(x+1)^2 = 1.
  • A330023 (program): a(n) counts the cube-words immediately before a(n), with a(1) = 0.
  • A330025 (program): a(n) = (-1)^floor(n/5) * sign(mod(n, 5)).
  • A330033 (program): a(n) = Kronecker(n, 5) * (-1)^floor(n/5).
  • A330038 (program): a(1) = 1, a(n) = [n/2] + a([n/2]) + a([(n+1)/2]) for n > 1, where [x] = floor(x).
  • A330063 (program): Beatty sequence for x, where 1/x + sech(x) = 1.
  • A330064 (program): Beatty sequence for cosh(x), where 1/x + sech(x) = 1.
  • A330066 (program): Beatty sequence for x, where 1/x + csch(x) = 1.
  • A330067 (program): Beatty sequence for sinh(x), where 1/x + 1/sinh(x) = 1.
  • A330082 (program): a(n) = 5*A064038(n).
  • A330085 (program): Length of longest binary word with the property that all distinct occurrences of identical-length blocks agree on at most n positions.
  • A330094 (program): Beatty sequence for 2^x, where 1/2^x + 1/3^(x-1) = 1.
  • A330095 (program): Beatty sequence for 3^(x-1), where 1/2^x + 1/3^(x-1) = 1.
  • A330112 (program): Beatty sequence for e^x, where 1/e^x + sech(x) = 1.
  • A330113 (program): Beatty sequence for cosh(x), where 1/e^x + sech(x) = 1.
  • A330115 (program): Beatty sequence for e^x, where 1/e^x + csch(x) = 1.
  • A330116 (program): Beatty sequence for sinh(x), where 1/e^x + csch(x) = 1.
  • A330117 (program): Beatty sequence for 1+x, where 1/(1+x) + 1/(1+x+x^2) = 1.
  • A330118 (program): Beatty sequence for 1+x+x^2, where 1/(1+x) + 1/(1+x+x^2) = 1.
  • A330133 (program): a(n) = (1/16)(5 + (-1)^(1+n) - 4cos(nPi/2) + 10n^2).
  • A330143 (program): Beatty sequence for (3/2)^x, where (3/2)^x + (5/2)^x = 1.
  • A330144 (program): Beatty sequence for (5/2)^x, where (3/2)^x + (5/2)^x = 1.
  • A330151 (program): Partial sums of 4th powers of the even numbers.
  • A330170 (program): a(n) = 2^n + 3^n + 6^n - 1.
  • A330171 (program): a(n) = n + floor(ns/r) + floor(nt/r), where r = sqrt(2) - 1, s = sqrt(2), t = sqrt(2) + 1.
  • A330172 (program): a(n) = n + floor(nr/t) + floor(ns/t), where r = sqrt(2) - 1, s = sqrt(2), t = sqrt(2) + 1.
  • A330173 (program): a(n) = n + floor(ns/r) + floor(nt/r), where r = sqrt(2), s = sqrt(2) + 1, t = sqrt(2) + 2.
  • A330179 (program): a(n) = n + floor(ns/r) + floor(nt/r), where r = e - 1, s = e, t = e + 1.
  • A330180 (program): a(n) = n + floor(nr/t) + floor(ns/t), where r = e - 1, s = e, t = e + 1.
  • A330181 (program): a(n) = n + floor(ns/r) + floor(nt/r), where r = Pi - 1, s = Pi, t = Pi + 1.
  • A330186 (program): a(n) = n + floor(nr/t) + floor(ns/t), where r = tau - 1/2, s = tau, t = tau + 1/2, tau = golden ratio = (1+sqrt(5))/2.
  • A330197 (program): Number of scalene triangles whose vertices are the vertices of a regular n-gon.
  • A330225 (program): Position of first appearance of n in A290103 = LCM of prime indices.
  • A330246 (program): a(n) = 4^(n+1) + (4^n-1)/3.
  • A330285 (program): The maximum number of arithmetic progressions for a sequence of length n.
  • A330298 (program): a(n) is the number of subsets of 1..n that contain exactly 1 odd and 2 even numbers.
  • A330299 (program): a(n) is the number of subsets of 1..n that contain exactly 1 odd and 3 even numbers.
  • A330319 (program): a(n) = Sum_ i=1..n phi(i)*phi(i+1), where phi(n) = A000010(n) is Euler’s totient function.
  • A330320 (program): a(n) = Sum_ i=1..n tau(i)*tau(i+1), where tau(n) = A000005(n) is the number of divisors of n.
  • A330321 (program): a(n) = Sum_ i=1..n tau(i)*tau(i+1)/2, where tau(n) = A000005(n) is the number of divisors of n.
  • A330322 (program): a(n) = Sum_ i=1..n sigma(i)*sigma(i+1), where sigma(n) = A000203(n) is the sum of the divisors of n.
  • A330323 (program): a(n) = Moebius(n)*Moebius(n+1).
  • A330324 (program): a(n) = Sum_ i=1..n Moebius(i)*Moebius(i+1), where Moebius(n) = A008683(n).
  • A330357 (program): a(n) = (2*n^2 + 9 - (-1)^n)/4.
  • A330393 (program): A 2-regular sequence whose reciprocal is not 2-regular.
  • A330395 (program): Number of nontrivial equivalence classes of S_n under the 1234,3412 pattern-replacement equivalence.
  • A330396 (program): Permutation of the nonnegative integers partitioned into triples [3k+2, 3k+1, 3*k] for k >= 0.
  • A330410 (program): a(n) = 6*prime(n) - 1.
  • A330451 (program): a(n) = a(n-3) + 20*n - 30 for n > 2, with a(0)=0, a(1)=3, a(2)=13.
  • A330476 (program): a(n) = Sum_ m=2..n floor(n/m)^2.
  • A330479 (program): Decimal expansion of 2e^2-2 (or 2(e^2-1)).
  • A330492 (program): a(n) = sum of second differences of the sorted divisors of n.
  • A330503 (program): Number of Sós permutations of 0,1,…,n .
  • A330520 (program): Sum of even integers <= n times the sum of odd integers <= n.
  • A330560 (program): a(n) = number of primes p <= prime(n) with Delta(p) == 2 mod 4, where Delta(p) = nextprime(p) - p.
  • A330561 (program): a(n) = number of primes p <= prime(n) with Delta(p) == 0 mod 4, where Delta(p) = nextprime(p) - p.
  • A330565 (program): The thirteen entries from A005848 for which the integers of the cyclotomic field form a Euclidean ring with respect to the norm.
  • A330569 (program): a(n) = 1 if n is odd, otherwise a(n) = 2^(v-1)+1 where v is the 2-adic valuation of n (A007814(n)).
  • A330571 (program): Square of number of unordered factorizations of n as n = i*j.
  • A330602 (program): a(n) = a(n-1) XOR (n+1), with a(0) = 0.
  • A330640 (program): a(n) is the number of partitions of n with Durfee square of size <= 2.
  • A330651 (program): a(n) = n^4 + 3n^3 + 2n^2 - 2*n.
  • A330700 (program): a(n) = (n - 1)n(2n^2 + 4n - 1)/6.
  • A330707 (program): a(n) = ( 3*n^2 + n - 1 + (-1)^floor(n/2) )/4.
  • A330709 (program): Two-column table read by rows: pairs (i,j) in order sorted from the left.
  • A330740 (program): a(n) = min(n, A004488(n)), where A004488(n) is base-3 sum n+n without carries.
  • A330761 (program): Array read by antidiagonals: T(n,k) is the number of faces on a ring formed by connecting the ends of a prismatic rod whose cross-section is an n-sided regular polygon after applying a twist of k/n turns.
  • A330770 (program): a(n) = 19 * 8^n + 17 for n >= 0.
  • A330795 (program): Evaluation of the polynomials given by the Riordan square of the Fibonacci sequence with a(0) = 1 (A193737) at 1/2 and normalized with 2^n.
  • A330797 (program): Evaluation of the Stirling cycle polynomials at -1/2 and normalized with (-2)^n.
  • A330805 (program): Number of squares and rectangles in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.
  • A330859 (program): The additive version of the ‘Decade transform’ : to obtain a(n) write n as a sum of its power-of-ten parts and then continue to calculate the sum of the adjacent parts until a single number remains.
  • A330866 (program): a(n) = Sum_ d n, d<n (n/d) * (n-d).
  • A330881 (program): Length of longest LB factorization over all binary strings of length n.
  • A330910 (program): a(n-5) is the number of nonempty subsets of 1,2,…,n such that the difference of successive elements is at least 5.
  • A330926 (program): a(n) = Sum_ k=1..n (ceiling(n/k) mod 2).
  • A330938 (program): Numbers that cannot be written as the sum of four proper powers. A proper power is an integer of the form a^b where a,b are integers greater than or equal to 2.
  • A330983 (program): Alternatively add and multiply pairs of the nonnegative integers.
  • A330987 (program): Alternatively add and half-multiply pairs of the nonnegative integers.
  • A331044 (program): a(n) is the greatest prime number of the form floor(n/10^k) for some k >= 0, or 0 if no such prime number exists.
  • A331112 (program): Sum of the digits of the n-th prime number in balanced ternary.
  • A331134 (program): a(n) = Sum_ primes p <= n r_2(p)/4, where r_2(n) = A004018(n).
  • A331162 (program): a(n) is the number of digits in the concatenation of a(0) to a(n-1) that are equal to the corresponding digit in the concatenation of all integers >= 0, with a(0) = 0.
  • A331176 (program): a(n) = n - n/gcd(n, phi(n)), where phi is Euler totient function.
  • A331190 (program): Expansion of (-5(9 - 6x + 2*x^2))/(-1 + x)^3.
  • A331211 (program): Number of green nodes in n-th power graph W exponentiation of a cycle graph with 7 blue nodes and one green node.
  • A331261 (program): List of pairs of numbers having certain properties (see Comments).
  • A331321 (program): a(n) = [x^n] ((x^2 - 1)(x^2 + x - 1))/(x^2 + 2x - 1)^2.
  • A331347 (program): Number of permutations w in S_n that form Boolean intervals [s, w] in the Bruhat order for every simple reflection s in the support of w.
  • A331353 (program): Number of achiral colorings of the edges (or triangular faces) of a regular 4-dimensional simplex with n available colors.
  • A331390 (program): Number of binary matrices with 3 distinct columns and any number of nonzero rows with n ones in every column and rows in nonincreasing lexicographic order.
  • A331417 (program): Maximum sum of primes of the parts of an integer partition of n.
  • A331418 (program): If A331417(n) is the maximum sum of primes of the parts of an integer partition of n, then a(n) = A331417(n) - n + 1.
  • A331429 (program): Expansion of x^2(10-5x+x^2)/((1-x)^4*(1-x^2)).
  • A331433 (program): Column 1 of triangle in A331431.
  • A331434 (program): Column 2 of triangle in A331431.
  • A331473 (program): Alternating sum of (n+1)*A000108(n+1).
  • A331476 (program): The (10^n)-th even-digit number.
  • A331477 (program): Number of n element multisets of n element multisets of an n-set.
  • A331501 (program): Decimal expansion of exp(3/4).
  • A331504 (program): Number of labeled graphs with n nodes and floor(n*(n-1)/4) edges.
  • A331505 (program): Number of labeled graphs with n nodes and floor(n/2) edges.
  • A331528 (program): a(n) = n^2 * (n+1)^2 * (n^2+n+1) / 12.
  • A331574 (program): a(n) is the number of subsets of 1..n that contain 3 even and 3 odd numbers.
  • A331677 (program): a(n) is the difference between the number of primes smaller than prime(n) (i.e., n-1) and greater than prime(n) but less than 2*prime(n).
  • A331714 (program): Number of non-isomorphic set-systems with 3 sets each with n elements.
  • A331739 (program): a(n) is n minus its largest odd divisor.
  • A331743 (program): Lexicographically earliest infinite sequence such that a(i) = a(j) => A002487(i) = A002487(j) and A323901(i) = A323901(j) for all i, j.
  • A331764 (program): a(n) = ((p-1)^3 - (p-1)^2)/4 where p is the n-th prime.
  • A331943 (program): a(n) = n^2 + 1 - ceiling((n + 2)/3).
  • A331952 (program): a(n) = (-7 + (-1)^(1+n) + 6*n^2) / 8.
  • A331987 (program): a(n) = ((n + 1) - 9(n + 1)^2 + 8(n + 1)^3)/6.
  • A332019 (program): The number of cells added in the n-th generation of the following procedure: start by coloring any triangle on the snub square tiling, then repeatedly color every cell that shares a vertex with a colored cell.
  • A332023 (program): T(n, k) = binomial(n+2, 3) + binomial(k+1, 2) + binomial(k, 1). Triangle read by rows, T(n, k) for 0 <= k <= n.
  • A332026 (program): Savannah problem: number of new possibilities after n weeks.
  • A332027 (program): Savannah problem: number of distinct possible populations after n weeks, allowing populations after the empty set.
  • A332028 (program): Savannah problem: number of distinct possible populations after n weeks, not allowing new populations after the empty set.
  • A332044 (program): a(n) is the length of the shortest circuit that visits every edge of an undirected n X n grid graph.
  • A332049 (program): a(n) = (1/2) * Sum_ d n, d > 1 d * phi(d).
  • A332056 (program): a(1) = 1, then a(n+1) = a(n) - (-1)^a(n) Sum_ k=1..n a(k): if a(n) is odd, add the partial sum, else subtract.
  • A332057 (program): Partial sums (and absolute value of first differences) of A332056: if odd (resp. even) add (resp. subtract) the partial sum to get the next term.
  • A332101 (program): Least m such that m^n <= Sum_ k<m k^n.
  • A332102 (program): Least m > 0 such that 2*m^n <= Sum_ k < m k^n.
  • A332112 (program): a(n) = (10^(2n+1)-1)/9 + 10^n.
  • A332113 (program): a(n) = (10^(2n+1)-1)/9 + 2*10^n.
  • A332114 (program): a(n) = (10^(2n+1)-1)/9 + 3*10^n.
  • A332115 (program): a(n) = (10^(2n+1)-1)/9 + 4*10^n.
  • A332116 (program): a(n) = (10^(2n+1)-1)/9 + 5*10^n.
  • A332118 (program): a(n) = (10^(2n+1)-1)/9 + 7*10^n.
  • A332119 (program): a(n) = (10^(2n+1)-1)/9 + 8*10^n.
  • A332120 (program): a(n) = 2(10^(2n+1)-1)/9 - 210^n.
  • A332121 (program): a(n) = 2*(10^(2n+1)-1)/9 - 10^n.
  • A332123 (program): a(n) = 2*(10^(2n+1)-1)/9 + 10^n.
  • A332124 (program): a(n) = 2(10^(2n+1)-1)/9 + 210^n.
  • A332125 (program): a(n) = 2(10^(2n+1)-1)/9 + 310^n.
  • A332126 (program): a(n) = 2(10^(2n+1)-1)/9 + 410^n.
  • A332127 (program): a(n) = 2(10^(2n+1)-1)/9 + 510^n.
  • A332128 (program): a(n) = 2(10^(2n+1)-1)/9 + 610^n.
  • A332130 (program): a(n) = (10^(2n+1)-1)/3 - 3*10^n.
  • A332131 (program): a(n) = (10^(2n+1)-1)/3 - 2*10^n.
  • A332132 (program): a(n) = (10^(2n+1)-1)/3 - 10^n.
  • A332133 (program): Decimal expansion of (1 + sqrt(3))/2, unique positive root of x^2 - x - 1/2.
  • A332134 (program): a(n) = (10^(2n+1)-1)/3 + 10^n.
  • A332135 (program): a(n) = (10^(2n+1)-1)/3 + 2*10^n.
  • A332136 (program): a(n) = 3(10^(2n+1)-1)/9 + 310^n.
  • A332137 (program): a(n) = (10^(2n+1)-1)/3 + 4*10^n.
  • A332138 (program): a(n) = (10^(2n+1)-1)/3 + 510^n.
  • A332139 (program): a(n) = (10^(2n+1)-1)/3 + 610^n.
  • A332140 (program): a(n) = 4(10^(2n+1)-1)/9 - 410^n.
  • A332141 (program): a(n) = 4(10^(2n+1)-1)/9 - 3*10^n.
  • A332142 (program): a(n) = 4(10^(2n+1)-1)/9 - 2*10^n.
  • A332143 (program): a(n) = 4(10^(2n+1)-1)/9 - 10^n.
  • A332145 (program): a(n) = 4(10^(2n+1)-1)/9 + 10^n.
  • A332146 (program): a(n) = 4(10^(2n+1)-1)/9 + 2*10^n.
  • A332148 (program): a(n) = 4(10^(2n+1)-1)/9 + 4*10^n.
  • A332149 (program): a(n) = 4(10^(2n+1)-1)/9 + 5*10^n.
  • A332150 (program): a(n) = 5(10^(2n+1)-1)/9 - 510^n.
  • A332153 (program): a(n) = 5(10^(2n+1)-1)/9 - 2*10^n.
  • A332154 (program): a(n) = 5(10^(2n+1)-1)/9 - 10^n.
  • A332156 (program): a(n) = 5(10^(2n+1)-1)/9 + 10^n.
  • A332157 (program): a(n) = 5(10^(2n+1)-1)/9 + 2*10^n.
  • A332158 (program): a(n) = 5(10^(2n+1)-1)/9 + 3*10^n.
  • A332159 (program): a(n) = 5(10^(2n+1)-1)/9 + 4*10^n.
  • A332160 (program): a(n) = 6(10^(2n+1)-1)/9 - 610^n.
  • A332161 (program): a(n) = 6(10^(2n+1)-1)/9 - 5*10^n.
  • A332162 (program): a(n) = 6(10^(2n+1)-1)/9 - 4*10^n.
  • A332163 (program): a(n) = 6(10^(2n+1)-1)/9 - 3*10^n.
  • A332164 (program): a(n) = 6(10^(2n+1)-1)/9 - 2*10^n.
  • A332165 (program): a(n) = 6(10^(2n+1)-1)/9 - 10^n.
  • A332167 (program): a(n) = 6(10^(2n+1)-1)/9 + 10^n.
  • A332168 (program): a(n) = 6(10^(2n+1)-1)/9 + 2*10^n.
  • A332169 (program): a(n) = 6(10^(2n+1)-1)/9 + 3*10^n.
  • A332170 (program): a(n) = 7(10^(2n+1)-1)/9 - 710^n.
  • A332175 (program): a(n) = 7(10^(2n+1)-1)/9 - 210^n.
  • A332176 (program): a(n) = 7*(10^(2n+1)-1)/9 - 10^n.
  • A332178 (program): a(n) = 7*(10^(2n+1)-1)/9 + 10^n.
  • A332179 (program): a(n) = 7(10^(2n+1)-1)/9 + 210^n.
  • A332180 (program): a(n) = 8(10^(2n+1)-1)/9 - 810^n.
  • A332182 (program): a(n) = 8(10^(2n+1)-1)/9 - 610^n.
  • A332183 (program): a(n) = 8(10^(2n+1)-1)/9 - 510^n.
  • A332184 (program): a(n) = 8(10^(2n+1)-1)/9 - 410^n.
  • A332185 (program): a(n) = 8(10^(2n+1)-1)/9 - 310^n.
  • A332186 (program): a(n) = 8(10^(2n+1)-1)/9 - 210^n.
  • A332187 (program): a(n) = 8*(10^(2n+1)-1)/9 - 10^n.
  • A332189 (program): a(n) = 8*(10^(2n+1)-1)/9 + 10^n.
  • A332190 (program): a(n) = 10^(2n+1) - 1 - 9*10^n.
  • A332191 (program): a(n) = 10^(2n+1) - 1 - 8*10^n.
  • A332192 (program): a(n) = 10^(2n+1) - 1 - 7*10^n.
  • A332193 (program): a(n) = 10^(2n+1) - 1 - 6*10^n.
  • A332194 (program): a(n) = 10^(2n+1) - 1 - 5*10^n.
  • A332195 (program): a(n) = 10^(2n+1) - 4*10^n - 1.
  • A332196 (program): a(n) = 10^(2n+1) - 1 - 3*10^n.
  • A332197 (program): a(n) = 10^(2n+1) - 1 - 2*10^n.
  • A332202 (program): Largest k >= 0 such that 3^k divides 2^(2^n-1) + 1.
  • A332206 (program): Numbers k such that A332205(k) = 0.
  • A332209 (program): Starting from sigma(n), number of halving and tripling steps to reach 1 in ‘3x+1’ problem, or -1 if 1 is never reached.
  • A332224 (program): a(n) = A087808(sigma(n)).
  • A332243 (program): Starhex honeycomb numbers: a(n) = 13 + 60n + 60n^2.
  • A332264 (program): Partial sums of A334136.
  • A332288 (program): Number of unimodal permutations of the multiset of prime indices of n.
  • A332410 (program): a(n) = 2a(n-1) - a(n-2) + a(n-5) - 2a(n-6) + a(n-7) with a(0)=0, a(1)=1, a(2)=3, a(3)=6, a(4)=11, a(5)=17, a(6)=24.
  • A332420 (program): Number of Maclaurin polynomials of sin x having exactly n positive zeros.
  • A332442 (program): Triangle read by rows, T(n,k) is the number of regular triangles of length k (in some length unit), for k from 1, 2, … , n , in a matchstick arrangement with enclosing triangle of length n, but only triangles with orientation opposite to the enclosing triangle are counted.
  • A332459 (program): Odd part of 1+sigma(n).
  • A332464 (program): Rule 124 one-dimensional cellular automaton applied for one step to the configuration read from the base-2 expansion of sigma(n), then converted back to decimal.
  • A332490 (program): a(n) = Sum_ k=1..n k * ceiling(n/k).
  • A332495 (program): a(n-2) = a(n-6) + 5(1+2n) with a(0)=0, a(1)=2, a(2)=7, a(3)=15 for n>=4.
  • A332519 (program): a(n) = 4*(n^2+n-2).
  • A332552 (program): a(n) = A082184(n) - A082183(n).
  • A332553 (program): a(n) = n + A082183(n) - A082184(n).
  • A332557 (program): Number of inequivalent Z_ 2^s -linear Hadamard codes of length 2^n.
  • A332569 (program): a(n) = Sum_ k=1..n floor(n/k) * ceiling(n/k).
  • A332602 (program): Tridiagonal matrix M read by antidiagonals: main diagonal is 1,2,2,2,2,…, two adjacent diagonals are 1,1,1,1,1,…
  • A332613 (program): Covering radius of the dihedral group code D_n.
  • A332623 (program): a(n) = Sum_ k=1..n ceiling(n/k)^2.
  • A332663 (program): Even bisection of A332662: the x-coordinates of an enumeration of N X N.
  • A332682 (program): a(n) = Sum_ k=1..n (-1)^(k+1) * ceiling(n/k).
  • A332687 (program): a(n) = Sum_ k=1..n ceiling(n/prime(k)).
  • A332697 (program): a(n) = (n^4 + 5n^3 + 11n^2 + 7*n)/6.
  • A332698 (program): a(n) = (8n^3 + 15n^2 + 13*n)/6.
  • A332699 (program): First row of A332662, also main diagonal of A332667.
  • A332754 (program): a(n) = Sum_ k=1..n-1 ((-1)^(k+n+1)*binomial(k,floor(k/2))).
  • A332756 (program): A loop sequence within Pi. Let a(1) = 19. For n > 1, a(n+1) is the position of the first occurrence of a(n) after the decimal point in the decimal expansion of Pi.
  • A332775 (program): a(n) = n + sopf(n) - omega(n).
  • A332872 (program): Number of ordered set partitions of 1..n where no element of any block is greater than any element of a non-adjacent consecutive block.
  • A332884 (program): a(n) = -n^2 + 21*n - 1.
  • A332917 (program): A332916(n)/2^a(n) is the average number of binary strings of length n with Levenshtein distance <= 3 from a uniform randomly sampled binary string of this length.
  • A332919 (program): a(n) is the sum of the sums of squared digits of all n-digit numbers.
  • A332921 (program): Number of symmetric non-isomorphic free unrooted snake-shaped polyominoes of maximum length on a quadratic board of n X n squares.
  • A332937 (program): a(n) is the greatest common divisor of the first two terms of row n of the Wythoff array (A035513).
  • A332958 (program): Number of labeled forests with 2n nodes consisting of n-1 isolated nodes and a labeled tree with n+1 nodes.
  • A332993 (program): a(1) = 1, for n > 1, a(n) = n + a(A032742(n)).
  • A332994 (program): a(1) = 1, for n > 1, a(n) = n + a(A052126(n)).
  • A333125 (program): a(n) = binomial(Fibonacci(n),n).
  • A333167 (program): a(n) = r_2(n^2 + 1), where r_2(k) is the number of ways of writing k as a sum of 2 squares (A004018).
  • A333168 (program): a(n) = Sum_ k=0..n r_2(k^2 + 1), where r_2(k) is the number of ways of writing k as a sum of 2 squares (A004018).
  • A333169 (program): a(n) = phi(n^2 + 1), where phi is the Euler totient function (A000010).
  • A333170 (program): a(n) = Sum_ k=0..n phi(k^2 + 1), where phi is the Euler totient function (A000010).
  • A333171 (program): a(n) = Sum_ k=0..n d(k^2 + 1), where d(k) is the number of divisors of k (A000005).
  • A333172 (program): a(n) = Sum_ k=0..n sigma(k^2 + 1), where sigma(k) is the sum of divisors of k (A000203).
  • A333173 (program): a(n) = r_4(n^2 + 1), where r_4(k) is the number of ways of writing k as a sum of 4 squares (A000118).
  • A333174 (program): a(n) = Sum_ k=0..n r_4(k^2 + 1), where r_4(k) is the number of ways of writing k as a sum of 4 squares (A000118).
  • A333175 (program): If n = Product (p_j^k_j) then a(n) = Sum (a(n/p_j^k_j)), with a(1) = 1.
  • A333183 (program): Number of digits in concatenation of first n positive even integers.
  • A333206 (program): a(n) is the least decimal digit of n^3.
  • A333251 (program): Tropical version of Somos-5 sequence A006721.
  • A333296 (program): Largest number of non-congruent integer-sided bricks that can be assembled into an n X n X n cube.
  • A333297 (program): a(n) = Sum_ i=1..n, j=1..n, gcd(i,j)=1 i.
  • A333315 (program): a(n) = Sum_ k=1..n phi(prime(k)-1), where phi is the Euler totient function (A000005).
  • A333317 (program): Partial sums of A248577.
  • A333319 (program): a(n) is the number of subsets of 1..n that contain exactly 3 odd and 1 even numbers.
  • A333320 (program): a(n) is the number of subsets of 1..n that contain exactly 4 odd and 1 even numbers.
  • A333321 (program): a(n) is the number of subsets of 1..n that contain exactly 1 odd and 4 even numbers.
  • A333344 (program): a(n) = 11a(n-1) - 9a(n-2) starting a(0)=1, a(1)=10.
  • A333345 (program): Decimal expansion of (11 + sqrt(85))/2.
  • A333355 (program): Number of bits in binary expansion of n minus the number of digits of n when written in base 3.
  • A333415 (program): Odd positive integers in base 2 read backwards.
  • A333461 (program): a(n) = gcd(2n, binomial(2n,n))/2.
  • A333470 (program): Lexicographically earliest sequence of distinct positive terms such that a(n) is the number of commas that a(n) has to step over (to the right) to be met by an odd term. This odd term might not be the closest odd term to a(n).
  • A333516 (program): Irregular triangle read by rows in which row n lists the first A000217(n) terms of A002260, n >= 1.
  • A333525 (program): Degree of polytope representing the number n.
  • A333535 (program): Card k<=n, k such that all prime divisors of k are < sqrt(k) .
  • A333574 (program): Number of Hamiltonian paths in the n X 2 grid graph which start at any of the n vertices on left side of the graph and terminate at any of the n vertices on the right side.
  • A333588 (program): a(n) = floor(-(3/2)*a(n-1)), a(1)=-2.
  • A333596 (program): a(0) = 0; for n > 0, a(n) = a(n-1) + (number of 1’s and 3’s in base-4 representation of n) - (number of 0’s and 2’s in base-4 representation of n).
  • A333599 (program): a(n) = Fibonacci(n) * Fibonacci(n+1) mod Fibonacci(n+2).
  • A333616 (program): Expansion of x(1 + 2x + x^2 - 4x^3 - x^4 + 2x^5)/((1 - x)^3*(1 + x)^2).
  • A333637 (program): The number of cells which contain multiple squares of a Genealodron formed from 2^n - 1 equal-sized squares (when viewed from above).
  • A333714 (program): Squares visited by a chess king moving on a square-spiral numbered board where the king moves to the adjacent unvisited square containing the spiral number with the most divisors. In case of a tie it chooses the square with the highest spiral number.
  • A333718 (program): a(n) = L(8*n+4)/7, where L=A000032 (the Lucas sequence).
  • A333766 (program): Maximum part of the n-th composition in standard order. a(0) = 0.
  • A333768 (program): Minimum part of the n-th composition in standard order. a(0) = 0.
  • A333772 (program): a(n) = n * 2^n * (n!)^2.
  • A333794 (program): a(1) = 1, for n > 1, a(n) = n + a(n-A052126(n)).
  • A333813 (program): a(n) = 2^(1 + floor(n*log_2(3))) - (3^n + 1).
  • A333841 (program): Integers n such that n! = x^2 + y^3 + z^4 where x, y and z are nonnegative integers, is soluble.
  • A333870 (program): The number of iterations of the absolute Möbius divisor function (A173557) required to reach from n to 1.
  • A333884 (program): Difference between smallest cube > n and n.
  • A333996 (program): Number of composite numbers in the triangular n X n multiplication table.
  • A334039 (program): For any n > 0: start with x = n; for k = 1..n, if k divides x then divide x by k; a(n) corresponds to the final value of x.
  • A334042 (program): Write n^2 in binary, interchange 0’s and 1’s, convert back to decimal.
  • A334051 (program): The difference between the number of prime numbers in the ranges (1, p_n] and (p_n, 2*p_n], where p_n is the n-th prime.
  • A334070 (program): Number of even-order elements in the multiplicative group of integers modulo n.
  • A334076 (program): a(n) = bitwise NOR of n and 2n.
  • A334084 (program): Integers m such that only 2 binomial coefficients C(m,k), with 0<=k<=m, are practical numbers.
  • A334085 (program): GCD of n and the product of all primes < n.
  • A334136 (program): a(n) = (n-1)*sigma(n) where sigma is the sum of divisors A000203.
  • A334155 (program): a(n) is the number of length n decorated permutations avoiding the pattern 001.
  • A334169 (program): a(n) is the number of ON-cells in the n-th full level of ON-cells of a triangular wedge in the hexagonal grid of A151723 (after 2^k >= n generations have been computed).
  • A334210 (program): a(n) = sigma(prime(n) + 1) - sigma(prime(n)).
  • A334227 (program): Length of the shortest prefix of the Thue-Morse sequence (A010060) containing, as subwords, all length-n blocks appearing in A010060.
  • A334277 (program): Perimeters of almost-equilateral Heronian triangles.
  • A334293 (program): First quadrisection of Padovan sequence.
  • A334320 (program): Number of even integers in base n with exactly two distinct digits.
  • A334381 (program): Decimal expansion of Sum_ k>=0 1/(2^k*(k!)^2).
  • A334387 (program): The difference version of the ‘Decade transform’ : to obtain a(n) write n as a sum of its power-of-ten parts and then continue to calculate the absolute value of the difference between the adjacent parts until a single number remains.
  • A334413 (program): First differences of A101803.
  • A334414 (program): First differences of A334415.
  • A334415 (program): Nearest integer to n*(2-phi), where phi is the golden ratio (A001622).
  • A334501 (program): Eventual period of a single cell in rule 190 cellular automaton in a cyclic universe of width n.
  • A334563 (program): a(n) is the maximum number of 4-cycles possible in an n-vertex planar graph.
  • A334572 (program): Let x(n, k) be the exponent of prime(k) in the factorization of n, then a(n) = Max_ k abs(x(n,k)- x(n-1,k)).
  • A334573 (program): Partial sums of A334572.
  • A334576 (program): a(n) is the X-coordinate of the n-th point of the space filling curve P defined in Comments section; sequence A334577 gives Y-coordinates.
  • A334603 (program): Period length of the fraction 1/11^n for n >= 1.
  • A334614 (program): a(n) = pi(prime(n) - n) + n, where pi is the prime counting function.
  • A334625 (program): Maximal size of a subset T of S = 1,2,…,n with a cyclic arrangement of T such that any three neighbors can be reordered in an arithmetic progression.
  • A334657 (program): Dirichlet g.f.: 1 / zeta(s-2).
  • A334659 (program): Dirichlet g.f.: 1 / zeta(s-3).
  • A334660 (program): Dirichlet g.f.: 1 / zeta(s-4).
  • A334673 (program): a(n) = 23*a(n-1) - a(n-2) + 1 for n > 1, a(0)=0, a(1)=1.
  • A334694 (program): a(n) = (n/4)(n^3+2n^2+5*n+8).
  • A334702 (program): Array read by antidiagonals: T(n,k) = binomial(n*k,3), n>=0, k>=0.
  • A334703 (program): Triangle read by rows: T(n,k) = binomial(n*k,3) (0 <= k <= n).
  • A334706 (program): Number of collinear triples in a 4 X n rectangular grid.
  • A334762 (program): a(n) = ceiling (n / A000005(n)).
  • A334789 (program): a(n) = 2^log_2(n) where log_2(n) = A001069(n) is the number of log_2(log_2(…log_2(n))) iterations needed to reach < 2.
  • A334841 (program): a(0) = 0; for n > 0, a(n) = (number of 1’s and 3’s in base 4 representation of n) - (number of 0’s and 2’s in base 4 representation of n).
  • A334907 (program): Comtet’s expansion of the e.g.f. (sqrt(1 + sqrt(8s)) - sqrt(1 - sqrt(8s)))/ sqrt(8s * (1 - 8s)).
  • A334913 (program): a(n) is the sum of digits of n in signed binary nonadjacent form.
  • A334954 (program): a(n) is 1 plus the number of divisors of n.
  • A334988 (program): Sum of tetrahedral numbers dividing n.
  • A335021 (program): a(n) = Sum_ d n, 1 < d < n (-1)^(d + 1).
  • A335022 (program): a(n) = Sum_ d n, 1 < d < n (-1)^(d + 1) * d.
  • A335025 (program): Largest side lengths of almost-equilateral Heronian triangles.
  • A335048 (program): Minimum sum of primes (see Comments).
  • A335063 (program): a(n) = Sum_ k=0..n (binomial(n,k) mod 2) * k.
  • A335073 (program): a(n) = Sum_ k=1..n 2^(bigomega(k) - omega(k)).
  • A335087 (program): Row sums of A335436.
  • A335115 (program): a(2n) = 2n - a(n), a(2n+1) = 2n + 1.
  • A335129 (program): a(n) is the number of distinct lines created inside an n-gon when connecting vertex k to vertex 2k mod n.
  • A335262 (program): Triangle of triangular numbers, read by rows, constructed like this: Given a sequence t, start row 0 with t(0). Compute row n for n > 0 by reversing row n-1 and prepending t(n). The sequence t is here chosen as the triangular numbers.
  • A335285 (program): a(n) is the greatest possible greatest part of any partition of n into prime parts.
  • A335298 (program): a(n) is the squared distance between the points P(n) and P(0) on a plane, n>=0, such that the distance between P(n) and P(n+1) is n+1 and, going from P(n) to P(n+2), a 90-degree-left-turn is taken in P(n+1).
  • A335341 (program): Sum of divisors of A003557(n).
  • A335402 (program): Numbers m such that the only normal integer partition of m whose run-lengths are a palindrome is (1)^m.
  • A335408 (program): Diameter of nearest neighbor interchange distance for free 3-trees.
  • A335429 (program): Partial sums of A329697.
  • A335439 (program): a(n) = n*(n-1)/2 + 2^(n-1) - 1.
  • A335567 (program): Number of distinct positive integer pairs, (s,t), such that s <= t < n where neither s nor t divides n.
  • A335608 (program): Number of sets (in the Hausdorff metric geometry) at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 2) missing one edge.
  • A335616 (program): a(n) is twice the number of partitions of n into consecutive parts, minus the number of partitions of n into consecutive parts that contain 1 as a part.
  • A335647 (program): a(n) = binomial(4*n+1,n+1).
  • A335648 (program): Partial sums of A006010.
  • A335649 (program): a(n) is the frequency of multi-pairs in a sequence of multi-set designs with 2 blocks.
  • A335690 (program): a(1) = 1, a(2) = a(3) = 2; a(n) = (a(n-1) + a(n-2) + 1)/a(n-3) (for n>3).
  • A335691 (program): A000166(n)^2.
  • A335741 (program): Number of Pell numbers (A000129) <= n.
  • A335749 (program): a(n) = n![x^n] exp(2x)(ysinh(xy) + cosh(xy)) and y = sqrt(6).
  • A335756 (program): A cup filling problem starting with 2 empty cups of sizes 3 and n, where a(n) is the number of unreachable states (see details in comments).
  • A335789 (program): a(n) = time to the nearest second at the n-th instant (n>=0) when the hour and minute hands on a clock face coincide, starting at time 0:00.
  • A335807 (program): Number of vertices in the n-th simplex graph of the complete graph on three vertices (K_3).
  • A335821 (program): Triangular array T(n, k) = n^2 - k^2, read by rows.
  • A335841 (program): Number of distinct rectangles that can be made with one even and one odd side length that are divisors of 2n.
  • A335843 (program): a(n) is the number of n-digit positive integers with exactly two distinct base 10 digits.
  • A335860 (program): Partial sums of A064097.
  • A335876 (program): a(1) = 2, and for n > 1, a(n) = n + (n/p), where p is largest prime dividing n, A006530(n).
  • A335903 (program): Column 1 in the matrix of A279212 (whose indexing starts at 0).
  • A335927 (program): a(n+1) = Sum_ k=1..n (a(k) + k*(n-k)), with a(1)=1.
  • A335956 (program): a(n) = (2^n - 1)*2^valuation(n, 2) for n > 0 and a(0) = 0.
  • A335979 (program): Number of partitions of n into exactly two parts with no decimal carries.
  • A336040 (program): Characteristic function of refactorable numbers (A033950).
  • A336102 (program): Number of inseparable multisets of size n covering an initial interval of positive integers.
  • A336109 (program): First column of dispersion array A120861.
  • A336146 (program): Lexicographically earliest infinite sequence such that a(i) = a(j) => A000035(i) = A000035(j) and A000265(i) = A000265(j), for all i, j >= 1.
  • A336257 (program): a(n) = Catalan(n) mod (2*n+1).
  • A336266 (program): Decimal expansion of (3/16)*Pi.
  • A336276 (program): a(n) = Sum_ k=1..n mu(k)*k^2.
  • A336277 (program): a(n) = Sum_ k=1..n mu(k)*k^3.
  • A336278 (program): a(n) = Sum_ k=1..n mu(k)*k^4.
  • A336288 (program): Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1.
  • A336308 (program): Decimal expansion of (5/32)*Pi.
  • A336388 (program): Number of prime divisors of sigma(n) that divide n; a(1) = 0.
  • A336409 (program): Distance from prime(n) to the nearest odd composite that is < prime(n).
  • A336457 (program): a(n) = A065330(sigma(n)), where A065330 is fully multiplicative with a(2) = a(3) = 1, and a(p) = p for primes p > 3.
  • A336466 (program): Fully multiplicative with a(p) = A000265(p-1) for any prime p, where A000265(k) gives the odd part of k.
  • A336475 (program): Multiplicative with a(2^e) = 1, and for odd primes p, a(p^e) = (e+1)*p^e.
  • A336477 (program): a(n) = 1 if a regular n-gon is constructible with ruler (or, more precisely, an unmarked straightedge) and compass, 0 otherwise.
  • A336483 (program): Floor(n/10) + (5 times last digit of n).
  • A336502 (program): Partial sums of A057003.
  • A336529 (program): a(n) = (n^3+5n+3)/3 + 2floor(n/2) + a(n-2), with a(0)=1 and a(1)=3.
  • A336535 (program): a(n) = (m(n)^2 + 3)(m(n)^2 + 7)/32, where m(n) = 2n - 1.
  • A336551 (program): a(n) = A003557(n) - 1.
  • A336567 (program): Sum of proper divisors of n divided by its largest squarefree divisor .
  • A336627 (program): Coordination sequence for the Manhattan lattice.
  • A336642 (program): One less than the largest square dividing n: a(n) = A008833(n)-1.
  • A336643 (program): Squarefree kernel of n divided by the squarefree part of n: a(n) = rad(n) / core(n).
  • A336649 (program): Sum of divisors of A336651(n) (odd part of n divided by its largest squarefree divisor).
  • A336650 (program): a(n) = p^e, where p is the smallest odd prime factor of n, and e is its exponent, with a(n) = 1 when n is a power of two.
  • A336651 (program): Odd part of n divided by its largest squarefree divisor.
  • A336691 (program): Number of distinct prime factors of 1+sigma(n).
  • A336692 (program): Binary weight of 1+sigma(n).
  • A336694 (program): a(n) = A329697(1+sigma(n)), where A329697 is totally additive with a(2) = 0 and a(p) = 1 + a(p-1) for odd primes.
  • A336696 (program): Sum of odd divisors of 1+sigma(n).
  • A336698 (program): a(n) = A000265(1+A000265(sigma(n))), where A000265(k) gives the odd part of k.
  • A336699 (program): a(n) = A000265(1+A000265(sigma(A000265(n)))), where A000265(k) gives the odd part of k.
  • A336705 (program): Coordination sequence for the half-Manhattan lattice.
  • A336751 (program): Smallest side of integer-sided triangles whose sides a < b < c are in arithmetic progression.
  • A336754 (program): Perimeters in increasing order of integer-sided triangles whose sides a < b < c are in arithmetic progression.
  • A336804 (program): a(n) = (n!)^2 * Sum_ k=0..n 2^(n-k) / (k!)^2.
  • A336805 (program): a(n) = (n!)^2 * Sum_ k=0..n 3^(n-k) / (k!)^2.
  • A336807 (program): a(n) = (n!)^2 * Sum_ k=0..n 4^(n-k) / (k!)^2.
  • A336808 (program): a(n) = (n!)^2 * Sum_ k=0..n 5^(n-k) / (k!)^2.
  • A336809 (program): a(n) = (n!)^2 * Sum_ k=0..n (k+1) / ((n-k)!)^2.
  • A336819 (program): Odd values of D > 0 for which the generalized Ramanujan-Nagell equation x^2 + D = 2^m has two or more solutions in the positive integers.
  • A336840 (program): Inverse Möbius transform of A048673.
  • A336842 (program): Number of trailing 1-bits in the binary representation of A003961(n): a(n) = A007814(1+A003961(n)).
  • A336845 (program): a(n) = A000005(n) * A003961(n), where A003961 is the prime shift towards larger primes, and A000005 gives the number of divisors of n, and also of A003961(n).
  • A336850 (program): a(n) = gcd(A003961(n), sigma(A003961(n))), where A003961 is the prime shift towards larger primes.
  • A336851 (program): a(n) = sigma(A003961(n)) - A003961(n), where A003961 is a prime shift towards larger primes, sigma is the sum of divisors.
  • A336853 (program): a(n) = A003961(n) - n, where A003961 is the prime shift towards larger primes.
  • A336856 (program): Prime-shifted analog of gcd(d(n), sigma(n)): a(n) = gcd(A000005(n), A003973(n)).
  • A336861 (program): a(n) = ceiling((n-1-sqrt(n+1))/2).
  • A336867 (program): Numbers k such that k! does not have distinct prime multiplicities.
  • A336868 (program): Indicator function for numbers k such that k! has distinct prime multiplicities.
  • A336882 (program): a(0) = 1; for k >= 0, 0 <= i < 2^k, a(2^k + i) = m_k * a(i), where m_k is the least odd number not in terms 0..2^k - 1.
  • A336923 (program): a(n) = 1 if sigma(2n) - sigma(n) is a power of 2, otherwise 0.
  • A336924 (program): a(n) = spf(1+sigma(n)), where spf is the smallest prime factor and sigma is the sum of divisors function.
  • A336937 (program): The 2-adic valuation of sigma(n), the sum of divisors of n.
  • A337004 (program): Turn sequence of the R5 dragon curve.
  • A337024 (program): Number of ways to tile a 2n X 2n square with 1 X 1 white and n X n black squares.
  • A337025 (program): Number of n-state 2-symbol halt-free Turing machines.
  • A337030 (program): a(n) is the number of squarefree composite numbers < prime(n).
  • A337046 (program): Integers n such that n! = x^2 + y^3 + z^6 where x, y and z are nonnegative integers, is soluble.
  • A337101 (program): Number of partitions of n into two positive parts (s,t), s <= t, such that the harmonic mean of the smallest and largest part is an integer.
  • A337110 (program): Number of length three 1..n vectors that contain their geometric mean.
  • A337130 (program): a(n) is the sum of all products of pairs of numbers joined by the diagonals of an n-gon when its vertices are numbered from 1 to n in order.
  • A337134 (program): a(n) = Sum_ k=1..n floor(sqrt(2k-1)).
  • A337171 (program): a(n) = A004186(n) mod n.
  • A337173 (program): a(n) = Sum_ k=1..floor(n/2) k^2 * (n-k)^2.
  • A337174 (program): Number of pairs of divisors of n (d1,d2) such that d1 <= d2 and d1*d2 >= n.
  • A337175 (program): Number of pairs of divisors of n, (d1,d2), such that d1 <= d2 and d1*d2 < n.
  • A337178 (program): Number of biconnected geodetic graphs with n unlabeled vertices.
  • A337191 (program): If cards numbered 1 through n are “Down Two Table” shuffled (top two put on bottom one at a time, third from top card dealt to table) until all of the cards are placed on the table, a(n) is the number of the last card dealt.
  • A337194 (program): a(n) = 1 + A000265(sigma(n)), where A000265 gives the odd part.
  • A337195 (program): The 2-adic valuation of 1+A000265(sigma(n)), where A000265 gives the odd part.
  • A337252 (program): Digits of 2^n can be rearranged with no leading zeros to form t^2, for t not a power of 2.
  • A337273 (program): Number of distinct positive integer pairs, (s,t), such that s < t < n where neither s nor t divides n.
  • A337281 (program): a(n) = n*T(n), where T(n) = A000073(n) = n-th tribonacci number.
  • A337282 (program): Partial sums of A337281.
  • A337283 (program): a(n) = Sum_ i=0..n i*T(i)^2, where T(i) = A000073(i) is the i-th tribonacci number.
  • A337284 (program): a(n) = Sum_ i=1..n (i-1)*T(i)^2, where T(i) = A000073(i) is the i-th tribonacci number.
  • A337286 (program): a(n) = Sum_ i=0..n i^2*T(i)^2, where T(i) = A000073(i) is the i-th tribonacci number.
  • A337291 (program): a(n) = 3binomial(4n,n)/(4*n-1).
  • A337292 (program): a(n) = 4binomial(5n,n)/(5*n-1).
  • A337297 (program): Sum of the coordinates of all pairs of divisors of n, (d1,d2), such that d1 < d2.
  • A337300 (program): Partial sums of the geometric Connell sequence A049039.
  • A337313 (program): a(n) is the number of n-digit positive integers with exactly three distinct base 10 digits.
  • A337314 (program): a(n) is the number of n-digit positive integers with exactly four distinct base 10 digits.
  • A337319 (program): a(n) = Sum_ i = 1..floor(log_2(n))+1 g(frac(n/2^i)), where g(t) = [0 if t = 0, -1 if 0 < t < 1/2, 1 if t >= 1/2], and where frac(x) denotes the fractional part.
  • A337328 (program): Number of pairs of squarefree divisors of n, (d1,d2), such that d1 <= d2.
  • A337333 (program): Number of pairs of odd divisors of n, (d1,d2), such that d1 <= d2.
  • A337336 (program): a(n) = A048673(n^2).
  • A337348 (program): Numbers formed as the product of two numbers without consecutive equal binary digits and sharing no common bits between them.
  • A337360 (program): Sum of the coordinates of all pairs of divisors of n, (d1,d2), such that d1 <= d2.
  • A337392 (program): Minimum m such that the convergence speed of m^^m is equal to n >= 2, where A317905(n) represents the convergence speed of m^^m (and m = A067251(n), the n-th non-multiple of 10).
  • A337483 (program): Number of ordered triples of positive integers summing to n that are either weakly increasing or weakly decreasing.
  • A337484 (program): Number of ordered triples of positive integers summing to n that are neither strictly increasing nor strictly decreasing.
  • A337501 (program): Minimum number of painted cells in an n X n grid to avoid unpainted trominoes.
  • A337502 (program): Minimum number of painted cells in an n X n grid to avoid unpainted tetrominoes.
  • A337503 (program): Minimum number of painted cells in an n X n grid to avoid unpainted pentominoes.
  • A337509 (program): Number of partitions of n into two distinct parts (s,t), such that (t-s) n, and where n/(t-s) <= s < t.
  • A337519 (program): Length of the shortest walk in an n X n grid graph that starts in one corner and visits every edge.
  • A337524 (program): a(n) = d(n) * (d(n) - 1), where d is the number of divisors of n (A000005).
  • A337549 (program): a(n) = A003972(n) - n.
  • A337566 (program): a(n) is the number of possible decompositions of the polynomial n * (x + x^2 + … + x^q), where q>1, into a sum of k polynomials, not necessarily all different; each of these polynomials is to be of the form b_1 * x + b_2 * x^2 + … + b_q * x^q where each b_i is one of the numbers 1, 2, 3, …, q and no two b_i are equal.
  • A337623 (program): a(n) is the least positive multiple of 2*n-1 containing only the digits 0 and 1 in base n.
  • A337624 (program): a(n) is the least positive integer in base n that when multiplied by 2n-1 will contain only the digits 0 and 1.
  • A337631 (program): a(n) is the sum of the squares of diameters of all nonempty subsets of 1,2,…,n .
  • A337640 (program): a(n) = one-half of the number of cells in the central rectangle of the graph described in row 2n+1 of A333288.
  • A337821 (program): For n >= 0, a(4n+1) = 0, a(4n+3) = a(2n+1) + 1, a(2n+2) = a(n+1).
  • A337843 (program): a(n) is n + the number of digits in the decimal expansion of n.
  • A337851 (program): a(n) = (2^n + 2)^n.
  • A337852 (program): a(n) = (2^(n+1) + 1)^n.
  • A337855 (program): Number of n-digit positive integers that are the product of two integers ending with 5.
  • A337864 (program): Numbers formed by removing from n each digit if it is a duplicate of the previous digit, from left to right.
  • A337895 (program): Number of oriented colorings of the tetrahedral facets (or vertices) of a regular 4-dimensional simplex using n or fewer colors.
  • A337896 (program): Number of chiral pairs of colorings of the 8 triangular faces of a regular octahedron or the 8 vertices of a cube using n or fewer colors.
  • A337899 (program): Number of chiral pairs of colorings of the edges of a regular tetrahedron using n or fewer colors.
  • A337900 (program): The number of walks of length 2n on the square lattice that start from the origin (0,0) and end at the vertex (2,0).
  • A337901 (program): The number of walks of length 2n+1 on the square lattice that start from the origin (0,0) and end at the vertex (3,0).
  • A337909 (program): Distinct terms of A080079 in the order in which they appear.
  • A337923 (program): a(n) is the exponent of the highest power of 2 dividing the n-th Fibonacci number.
  • A337928 (program): Numbers w such that (F(2n+1)^2, -F(2n)^2, -w) are primitive solutions of the Diophantine equation 2x^3 + 2y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).
  • A337929 (program): Numbers w such that (F(2n-1)^2, -F(2n)^2, w) are primitive solutions of the Diophantine equation 2x^3 + 2y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).
  • A337934 (program): Sums of two distinct abundant numbers.
  • A337937 (program): a(n) = Euler totient function phi = A000010 evaluated at N(n) = floor((3*n-1)/2) = A001651(n), for n >= 1.
  • A337957 (program): Number of unoriented colorings of the 8 cubic facets of a tesseract or of the 8 vertices of a hyperoctahedron.
  • A337976 (program): Number of partitions of n into two distinct parts (s,t), such that s t, (t-s) n, and where n/(t-s) <= s < t.
  • A337985 (program): a(n) is the exponent of the highest power of 2 dividing the n-th Bell number.
  • A338041 (program): Draw n rays from each of two distinct points in the plane; a(n) is the number of regions thus created. See Comments for details.
  • A338042 (program): Draw n rays from each of two distinct points in the plane; a(n) is the number of vertices thus created. See Comments for details.
  • A338043 (program): Draw n rays from each of two distinct points in the plane; a(n) is the number of edges thus created. See Comments for details.
  • A338045 (program): G.f.: Sum_ k>=0 x^(2^k) / (1 - x^(2^k))^3.
  • A338046 (program): G.f.: Sum_ k>=0 x^(2^k) / (1 - x^(2^k))^4.
  • A338062 (program): Numbers k such that the Enots Wolley sequence A336957(k) is odd.
  • A338064 (program): Numbers k such that the Enots Wolley sequence A336957(k) is even.
  • A338086 (program): Duplicate the ternary digits of n, so each 0, 1 or 2 becomes 00, 11 or 22 respectively.
  • A338100 (program): Number of spanning trees in the n X 2 king graph.
  • A338101 (program): Smallest odd prime dividing n is a(n)-th prime, or 0 if no such prime exists.
  • A338109 (program): a(n)/A002939(n+1) is the Kirchhoff index of the join of the disjoint union of two complete graphs on n vertices with the empty graph on n+1 vertices.
  • A338110 (program): Number of spanning trees in the join of the disjoint union of two complete graphs each on n vertices with the empty graph on n vertices.
  • A338112 (program): Least number that is both the sum and product of n distinct positive integers.
  • A338117 (program): Number of partitions of n into two parts (s,t) such that (t-s) n, where s < t.
  • A338186 (program): Expansion of (2-6x-12x^2)/((1-x)^2(1-9x)).
  • A338199 (program): a(n) = v(1 + F(4n - 3)), where F(x) = (3x + 1)/2^v(3*x + 1), x is any odd natural number, and v(y) is the 2-adic valuation of y.
  • A338206 (program): Inverse of A160016.
  • A338226 (program): a(n) = Sum_ i=0..n-1 i10^i - Sum_ i=0..n-1 (n-1-i)10^i.
  • A338227 (program): a(n) = x(n) mod floor(sqrt(x(n))), where x(n) = floor((n^2)/2).
  • A338228 (program): Number of numbers less than or equal to n whose square does not divide n.
  • A338229 (program): Number of ternary strings of length n that contain at least one 0 and at most two 1’s.
  • A338230 (program): Number of ternary strings of length n that contain at least two 0’s and at most one 1.
  • A338231 (program): Sum of the numbers less than or equal to n whose square does not divide n.
  • A338233 (program): Number of numbers less than n whose square does not divide n.
  • A338234 (program): Sum of the numbers less than n whose square does not divide n.
  • A338281 (program): a(n) is the sum of n and the largest proper divisor of n.
  • A338321 (program): Trace of complement matrix for polynomial triangle centers of degree n (on the Nagel line).
  • A338329 (program): First differences of A326118.
  • A338353 (program): A (0,1)-matrix in the first quadrant read by downward antidiagonals: an example of a non-uniformly recurrent 2-D word having uniformly recurrent rows and columns.
  • A338354 (program): A (0,1)-matrix in the first quadrant read by downward antidiagonals: an example of a uniformly recurrent 2-D word in which row 0 is non-recurrent.
  • A338429 (program): Maximum number of copies of a 1234 permutation pattern in an alternating (or zig-zag) permutation of length n + 5.
  • A338506 (program): a(n) is the number of subsets of divisors of n.
  • A338524 (program): prime(n) Gray code decoding.
  • A338544 (program): a(n) = (5floor((n-1)/2)^2 + (4+(-1)^n)floor((n-1)/2)) / 2.
  • A338550 (program): Number of binary trees of height n such that the number of nodes at depth d equals d+1 for every d = 0..n.
  • A338576 (program): a(n) = n * pod(n) where pod(n) = the product of divisors of n (A007955).
  • A338588 (program): a(n)/A002939(n+1) is the Kirchhoff index of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.
  • A338595 (program): Denominators of resistance values < 1 ohm that can be obtained from a network of exactly 5 one-ohm resistors, but not from any network with fewer than 5 one-ohm resistors. Numerators are in A338580.
  • A338610 (program): Integers m such that there exist one prime p and one positive integer k, for which the expression k^3 + k^2*p is a perfect cube m^3.
  • A338616 (program): a(n) is twice the number of parts in all partitions of n into consecutive parts.
  • A338623 (program): a(n) is the length of the longest block of consecutive terms appearing twice (possibly with overlap) among the first n terms of the Thue-Morse sequence (A010060).
  • A338630 (program): Least number of odd primes that add up to n, or 0 if no such representation is possible.
  • A338648 (program): Number of divisors of n which are greater than 4.
  • A338649 (program): Number of divisors of n which are greater than 5.
  • A338650 (program): Number of divisors of n which are greater than 6.
  • A338651 (program): Number of divisors of n which are greater than 7.
  • A338652 (program): Number of divisors of n which are greater than 8.
  • A338653 (program): Number of divisors of n which are greater than 9.
  • A338666 (program): a(1)=1 and a(2)=2. For all n > 2, a(n) is the smallest number > a(n-1) by a number > the difference between a(n-1) and a(n-2) so that consecutive terms of sequence are always relatively prime.
  • A338722 (program): Row sums in triangle A338721.
  • A338727 (program): a(n) = C(n+1)^2 - 2C(n+1)C(n) + C(n)^2, where C() is a Catalan number.
  • A338733 (program): Partial sums of A054843.
  • A338760 (program): Subword complexity of a certain infinite word.
  • A338795 (program): Each term of A003215 (centered hexagonal numbers) is multiplied by the corresponding term of A003154 (centered dodecagonal numbers).
  • A338824 (program): Lexicographically earliest sequence of nonnegative integers such that for any distinct m and n, a(m) OR a(m+1) <> a(n) OR a(n+1) (where OR denotes the bitwise OR operator).
  • A338852 (program): a(n) = (7*floor(a(n-1)/3)) + (a(n-1) mod 3) with a(1) = 3.
  • A338857 (program): With S(n,k) = Sum_ n<=j<=k 1/(2*j+1), a(n)=k+1 such that S(n,k-1) < 1 <= S(n,k) for n>=0 and a(0)=1.
  • A338882 (program): Product of the nonzero digits of (n written in base 9).
  • A338896 (program): Inradii of Pythagorean triples of A338895.
  • A338920 (program): a(n) is the number of times it takes to iteratively subtract m from n where m is the largest nonzero proper suffix of n less than or equal to the remainder until no further subtraction is possible.
  • A338996 (program): Numbers of squares and rectangles of all sizes in 3n(n+1)/2-ominoes in form of three-quarters of Aztec diamonds.
  • A339012 (program): Written in factorial base, n ends in a(n) consecutive non-0 digits.
  • A339013 (program): Class number m containing n in a partitioning of the natural numbers into classes B_m by William J. Keith.
  • A339032 (program): Expansion of (4x^5 - 9x^4 + 17x^3 - 15x^2 + 6x - 1)/((2x - 1)^2*(x - 1)^3).
  • A339048 (program): a(n) = 2*n^2 + 9.
  • A339051 (program): Even bisection of the infinite Fibonacci word A096270.
  • A339052 (program): Odd bisection of the infinite Fibonacci word A096270.
  • A339053 (program): a(n) = least k such that the first n-block in A339051 occurs in A339052 beginning at the k-th term.
  • A339114 (program): Least semiprime whose prime indices sum to n.
  • A339136 (program): Number of (undirected) cycles in the graph C_3 X P_n.
  • A339183 (program): Number of partitions of n into two parts such that the smaller part is a nonzero square.
  • A339194 (program): Sum of all squarefree semiprimes with greater prime factor prime(n).
  • A339196 (program): Number of (undirected) cycles on the n X 2 king graph.
  • A339217 (program): a(n) = Sum_ k=1..n floor((2*n-k)/k).
  • A339240 (program): a(n) = n2^(2n-2) + nbinomial(2n,n)/2.
  • A339252 (program): a(0) = 1, a(1) = 4, a(2) = 11, and a(n) = 4a(n-1) - 4a(n-2) for n >= 3.
  • A339255 (program): Leading digit of n in base 5.
  • A339256 (program): Leading digit of n in base 6.
  • A339265 (program): Expansion of Product_ n >= 1 (1 - x^(2n))(1 - x^(2n-1))(1 - x^(2*n+1)).
  • A339267 (program): Level of the Calkin-Wilf tree in which the n-th convergent of the continued fraction for e appears.
  • A339308 (program): Partial sums of products of proper divisors of n (A007956).
  • A339332 (program): Sums of antidiagonals in A283683.
  • A339355 (program): Maximum number of copies of a 12345 permutation pattern in an alternating (or zig-zag) permutation of length n + 7.
  • A339356 (program): Maximum number of copies of a 123456 permutation pattern in an alternating (or zig-zag) permutation of length n + 9.
  • A339358 (program): Maximum number of copies of a 1234567 permutation pattern in an alternating (or zig-zag) permutation of length n + 11.
  • A339370 (program): a(n) = Sum_ k=1..floor(n/2) (n-k) * floor((n-k)/k).
  • A339391 (program): Maximum, over all binary strings w of length n, of the size of the smallest string attractor for w.
  • A339423 (program): If n = p_1 * … * p_m with primes p_i <= p_ i+1 , a(n) = Sum_ k<m Product_ j <= k p_j.
  • A339448 (program): a(n) = (prime(n) - a(n-1)) mod 3; a(0)=0.
  • A339451 (program): Gray-code-like sequence in which, at each step, the least significant bit that has never been toggled from the previous value, is toggled.
  • A339464 (program): a(n) = (prime(n)-1) / gpf(prime(n)-1) where gpf(m) is the greatest prime factor of m, A006530.
  • A339483 (program): Number of regular polygons that can be drawn with vertices on a centered hexagonal grid with side length n.
  • A339488 (program): a(n) = H(n-1, n, n+1) where H(a, b, c) = (a + b + c)(a + b - c)(b + c - a)*(c + a - b) is Heron’s polynomial.
  • A339516 (program): a(n+1) = (a(n) - 2(n-1)) * (2n-1), where a(1)=1.
  • A339531 (program): Numbers b > 1 such that the smallest two primes, i.e., 2 and 3 are base-b Wieferich primes.
  • A339570 (program): Denote the van der Corput sequence of fractions 1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, … (A030101/A062383) by v(n), n >= 1. Then a(n) = denominator of v(A014486(n)).
  • A339572 (program): If n even, a(n) = A000071(n/2+1); if n odd, a(n) = A001610((n-1)/2).
  • A339573 (program): a(n) = floor(n*(n+1)/6) - 1.
  • A339597 (program): When 2*n+1 first appears in A086799.
  • A339610 (program): Expansion of x(2 - x - x^2 - 2x^3)/(1 - x - x^2)^2.
  • A339623 (program): Consider a square drawn on the perimeter of a square lattice with side length n. a(n) is the number of regions inside the square after drawing unit circles centered at each interior lattice point of the square.
  • A339661 (program): Number of factorizations of n into distinct squarefree semiprimes.
  • A339684 (program): a(n) = Sum_ d n 4^(d-1).
  • A339685 (program): a(n) = Sum_ d n 5^(d-1).
  • A339686 (program): a(n) = Sum_ d n 6^(d-1).
  • A339687 (program): a(n) = Sum_ d n 7^(d-1).
  • A339688 (program): a(n) = Sum_ d n 8^(d-1).
  • A339689 (program): a(n) = Sum_ d n 9^(d-1).
  • A339747 (program): a(n) = (5^(valuation(n, 5) + 1) - 1) / 4.
  • A339748 (program): a(n) = (6^(valuation(n, 6) + 1) - 1) / 5.
  • A339765 (program): a(n) = 2floor(nphi) - 3*n, where phi = (1+sqrt(5))/2.
  • A339771 (program): a(n) = Sum_ i=0..n Sum_ j=0..n 2^max(i,j).
  • A339824 (program): Even bisection of the infinite Fibonacci word A003849.
  • A339825 (program): Odd bisection of the infinite Fibonacci word A003849.
  • A339903 (program): Fully multiplicative with a(p) = A000265(q-1), where q = A151800(p), the next prime > p.
  • A339904 (program): The odd part of Euler totient function phi applied to the prime shifted n : a(n) = A000265(A000010(A003961(n))).
  • A339905 (program): Fully multiplicative with a(prime(k)) = prime(k+1) - 1.
  • A339918 (program): a(n) = Sum_ k=1..n floor(3*n/k).
  • A339950 (program): Numbers k such that all k-sections of the infinite Fibonacci word A014675 have just two different run-lengths.
  • A339964 (program): a(n) = gcd(sigma(n), n+1).
  • A339966 (program): a(n) = (n+1) / gcd(sigma(n),n+1).
  • A339967 (program): a(n) = gcd(sigma(n), n+2).
  • A340068 (program): a(n) is the number of integers in the set n+1,n+2, . . . ,2n whose representation in base 2 contain exactly three digits 1’s.
  • A340071 (program): a(n) = gcd(A003961(n)-1, phi(A003961(n))), where A003961 shifts the prime factorization of n one step towards larger primes.
  • A340074 (program): a(n) = gcd(A003961(n)-1, A339904(n)).
  • A340081 (program): a(n) = gcd(n-1, A003958(n)).
  • A340082 (program): a(n) = A003958(n) / gcd(n-1, A003958(n)).
  • A340083 (program): a(n) = (n-1) / gcd(n-1, A003958(n)).
  • A340084 (program): a(n) = gcd(n-1, A336466(n)); Odd part of A340081(n).
  • A340085 (program): a(n) = A336466(n) / gcd(n-1, A336466(n)); Odd part of A340082(n).
  • A340086 (program): a(1) = 0, for n > 1, a(n) = A000265(n-1) / gcd(n-1, A336466(n)).
  • A340128 (program): a(n) = (n*prime(n)) mod prime(n+1).
  • A340134 (program): a(n+1) = a(n-2*a(n)) + 1, starting with a(1) = a(2) = 0.
  • A340184 (program): n with the rightmost occurrence of the smallest digit of n deleted.
  • A340199 (program): Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 3) missing two edges, where the two removed edges are not incident to the same vertex in the 3-point set and are also not incident to the same vertex in the other set.
  • A340227 (program): Number of pairs of divisors of n, (d1,d2), such that d1 < d2 and d1*d2 is squarefree.
  • A340228 (program): a(n) is the sum of the lengths of all the segments used to draw a rectangle of height 2^(n-1) and width n divided into 2^(n-1) rectangles of unit height, in turn, divided into rectangles of unit height and lengths corresponding to the parts of the compositions of n.
  • A340257 (program): a(n) = 2^n * (1+n*(n+1)/2).
  • A340266 (program): The number of degrees of freedom in a quadrilateral cell for a serendipity finite element space of order n.
  • A340301 (program): a(n) = n * floor(log_2(n)).
  • A340363 (program): a(n) = 1 if n is of the form of 2^i * p^j, with p an odd prime and i, j >= 0, otherwise 0.
  • A340369 (program): a(n) = 1 if n has at most 3 prime factors when counted with multiplicity, 0 otherwise.
  • A340371 (program): a(n) = 1 if the odd part of n is noncomposite, 0 otherwise.
  • A340373 (program): a(n) = 1 if n is of the form of 2^i * p^j, with p an odd prime, and i>=0, j>=1, otherwise 0.
  • A340375 (program): a(n) = 1 if n is of the form 2^i - 2^j with i >= j, and 0 otherwise.
  • A340378 (program): Number of 1-digits in the ternary representation of A048673(n).
  • A340379 (program): Number of 2-digits in the ternary representation of A048673(n).
  • A340395 (program): a(n) = A340131(A001006(n)).
  • A340445 (program): Number of partitions of n into 3 parts that are not all the same.
  • A340448 (program): Radio number of the cycle graph C_n.
  • A340461 (program): a(n) = 2*sigma(phi(n)) - n.
  • A340479 (program): a(n) = R(n) + digsum(n).
  • A340497 (program): Index where 2*n first appears in A340488.
  • A340498 (program): Where 2^n appears in A340488 for the first time.
  • A340507 (program): a(n) = floor(sqrt(2*n)) - A003056(n).
  • A340519 (program): Smallest order of a non-abelian group with a center of order n.
  • A340520 (program): a(n) = 2*A006463(n) + 1.
  • A340528 (program): Radio number of the path graph P_n.
  • A340536 (program): Digital root of 2*n^2.
  • A340615 (program): a(n) = k/2 if k is even, otherwise (3k+1)/2, where k = n+floor((n+1)/5).
  • A340619 (program): n appears A006519(n) times.
  • A340627 (program): a(n) = (112^n - 2(-1)^n)/3 for n >= 0.
  • A340631 (program): a(n) is the minimum number of pebbles such that any assignment of those pebbles on a complete graph with n vertices is a next-player winning game in the two-player impartial pebbling game.
  • A340632 (program): a(n) in binary is a run of 1-bits from the most significant 1-bit of n down to the least significant 1-bit of n, inclusive.
  • A340646 (program): a(n) = (prime(n)^n) mod prime(n+1).
  • A340648 (program): a(n) is the maximum number of nonzero entries in an n X n sign-restricted matrix.
  • A340649 (program): a(n) = (n*prime(n+1)) mod prime(n).
  • A340679 (program): If n is a power of prime then a(n) = 1, otherwise a(n) = product of the distinct prime factors of n.
  • A340709 (program): Let k = n/2+floor(n/4) if n is even, otherwise (3n+1)/2; then a(n) = A093545(k).
  • A340745 (program): a(n) is the number of “add the square” iterations required to reach or exceed 1 starting at 1/n.
  • A340757 (program): Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.
  • A340760 (program): Number of partitions of n into 4 parts whose largest 3 parts have the same parity.
  • A340761 (program): Number of partitions of n into 4 parts whose ‘middle’ two parts have the same parity.
  • A340764 (program): Number of primes p <= n that are congruent to 2 modulo 3.
  • A340767 (program): Number of primes p <= 6*n + 5 that are congruent to 2 modulo 3.
  • A340793 (program): Sequence whose partial sums give A000203.
  • A340849 (program): a(n) = A001045(n) + A052928(n).
  • A340867 (program): a(n) = (prime(n) - a(n-1)) mod 4; a(0)=0.
  • A341016 (program): Numbers k such that A124440(k) is a multiple of A066840(k).
  • A341043 (program): a(n) = 16n^3 - 36n^2 + 30*n - 9.
  • A341062 (program): Sequence whose partial sums give A000005.
  • A341104 (program): a(n) = [x^n] (x - 1)^4/((1 - 2x)(x^2 - 3*x + 1)).
  • A341209 (program): a(n) = (n^3 + 6n^2 + 17n + 6)/6.
  • A341248 (program): a(n) = 5a(n-1) - 4a(n-3) for n >= 4, where a(1) = 1, a(2) = 4, a(3) = 18.
  • A341250 (program): a(n) = 5a(n-1) - 4a(n-3) for n >= 4, where a(1) = 1, a(2) = 3, a(3) = 13.
  • A341282 (program): Numbers k such that there is no k-digit number m with the property that the binary expansion of m begins with the base-10 digits of m.
  • A341301 (program): a(n) = ceiling(n^2 - 7*n/3 + 19/3).
  • A341302 (program): a(n) = n! + (n-1)! + n-2.
  • A341307 (program): Expansion of (x^9+x^8+2x^7+x^6+2x^5+2*x^4+x^3+x^2+1)/(1-x^6)^2.
  • A341311 (program): G.f. = (1+x^2+2x^3+3x^4+4x^5+3x^6+4x^7+3x^8+2*x^9+x^10)/(1-x^6)^2.
  • A341315 (program): Triangle read by rows: T(n,k) = (n+k)/gcd(n,k), n>=0, 0<=k<=n.
  • A341345 (program): a(n) = A048673(n) mod 3.
  • A341346 (program): a(n) = A048673(2n-1) mod 3.
  • A341347 (program): a(n) = (1+A003961(A003961(n)))/2 mod 3, where A003961 shifts the prime factorization of n one step towards larger primes.
  • A341356 (program): The most significant digit in A097801-base.
  • A341361 (program): a(n) is the smallest abundant number of the form 2^e * prime(n).
  • A341389 (program): Characteristic function of A158705, nonnegative integers with an odd number of even powers of 2 in their base-2 representation.
  • A341414 (program): a(n) = (Fibonacci(n)*Lucas(n)) mod 10.
  • A341463 (program): a(n) = (-1)^(n+1) * (3^n+1)/2.
  • A341509 (program): a(n) = 2^j if n is of the form 2^i - 2^j with i > j, and 0 otherwise.
  • A341514 (program): Number of trailing zeros in A097801-base.
  • A341522 (program): a(n) = A156552(3*A005940(1+n)).
  • A341523 (program): Number of prime factors (with multiplicity) shared by n and sigma(n): a(n) = bigomega(gcd(n, sigma(n))).
  • A341528 (program): a(n) = n * sigma(A003961(n)), where A003961 shifts the prime factorization of n one step towards larger primes, and sigma is the sum of the divisors of n.
  • A341543 (program): a(n) = sqrt( Product_ j=1..n Product_ k=1..2 (4sin((2j-1)Pi/(2n))^2 + 4sin((2k-1)*Pi/2)^2) ).
  • A341544 (program): a(n) = sqrt( Product_ j=1..n Product_ k=1..4 (4sin((2j-1)Pi/(2n))^2 + 4sin((2k-1)*Pi/4)^2) ).
  • A341549 (program): a(n) = Sum_ k=1..n (-1)^(n+k)*A087322(n,k).
  • A341590 (program): a(n) = (Sum_ j=1..3 StirlingS1(3,j)*(2^j-1)^n)/3!.
  • A341591 (program): Number of superior prime divisors of n.
  • A341625 (program): a(n) = 1 if the arithmetic derivative of n is less than n, otherwise 0.
  • A341642 (program): Number of strictly superior prime divisors of n.
  • A341655 (program): a(n) is the number of divisors of prime(n)^2 - 1.
  • A341663 (program): a(n) is the number of divisors of prime(n)^3 - 1.
  • A341671 (program): Solutions y of the Diophantine equation 3*(x^2+x+1) = y^2.
  • A341703 (program): a(n) = 6binomial(n,4) + 2binomial(n,2) + 1.
  • A341706 (program): Row 2 of semigroup multiplication table shown in A341317 and A341318.
  • A341718 (program): Subtract 1 from each term of A004094 (the powers of 2 written backwards).
  • A341735 (program): a(n) = A007678(2*n+1).
  • A341740 (program): a(n) is the maximum value of the magic constant in a normal magic triangle of order n.
  • A341744 (program): a(0)=1, a(1)=2; for n > 1, a(n) = a(n - a(n-2)) + n.
  • A341765 (program): Let b(2m) be the number of even gaps 2m between successive odd primes from 3 up to prime(n). Let k1 = sum of all b(2m) when m == 1 (mod 3) and let k2 = sum of all b(2m) when m == 2 (mod 3). Then a(n) = k1 - k2.
  • A341768 (program): a(n) = n * (binomial(n,2) - 2).
  • A341865 (program): The cardinality of the largest multiset of positive integers whose product and sum equals n.
  • A341866 (program): The cardinality of the smallest (nontrivial, except for prime n) multiset of positive integers whose product and sum equal n.
  • A341900 (program): Partial sums of A005165.
  • A341915 (program): For any nonnegative number n with runs in binary expansion (r_1, …, r_w), a(n) = Sum_ k = 1..w 2^(r_1 + … + r_k - 1).
  • A341916 (program): Inverse permutation to A341915.
  • A341927 (program): Bisection of the numerators of the convergents of cf(1,4,1,6,1,6,…,6,1).
  • A341995 (program): a(n) = 1 if the arithmetic derivative (A003415) of n is a prime, otherwise 0.
  • A341999 (program): a(n) = 1 if the k-th arithmetic derivative is nonzero for all k >= 0, otherwise 0.
  • A342023 (program): a(n) = 1 if there is a prime p such that p^p divides n, otherwise 0.
  • A342089 (program): Numbers that have two representations as the sum of distinct non-consecutive Lucas numbers (A000032).
  • A342112 (program): Drop the final digit of n^5.
  • A342122 (program): a(n) is the remainder when the binary reverse of n is divided by n.
  • A342126 (program): The binary expansion of a(n) corresponds to that of n where all the 1’s have been replaced by 0’s except in the first run of 1’s.
  • A342131 (program): a(n) = n/2 + floor(n/4) if n is even, otherwise (3*n+1)/2.
  • A342138 (program): Array T(n,k) = (n+k)(3n+3k-5)/2 + (3k+1), read by ascending antidiagonals.
  • A342173 (program): a(n) = Sum_ j=1..n-1 floor(prime(n)/prime(j)).
  • A342235 (program): Coordination sequence of David Eppstein’s “Tetrastix” graph.
  • A342279 (program): A bisection of A000201: a(n) = A000201(2*n+1).
  • A342280 (program): a(n) = A001952(2*n+1).
  • A342281 (program): A bisection of A001951: a(n) = A001951(2*n+1).
  • A342350 (program): Numbers k such that lcm(1,2,3,…,k)/21 equals the denominator of the k-th harmonic number H(k).
  • A342352 (program): Expansion of e.g.f. (exp(x)-1)*(exp(x) - x^2/2 - x - 1).
  • A342362 (program): Expansion of the o.g.f. (1 + 8x + 10x^2 + 8x^3 + x^4)/((1 - x)^4(1 + x)^2).
  • A342363 (program): First differences of A341282.
  • A342369 (program): If n is congruent to 2 (mod 3), then a(n) = (2n - 1)/3; otherwise, a(n) = 2n.
  • A342379 (program): Expansion of e.g.f. (exp(x)-1)*(exp(x) - x^3/6 - x^2/2 - x - 1).
  • A342380 (program): Expansion of e.g.f. (exp(x)-1)*(exp(x) - x^4/24 - x^3/6 - x^2/2 - x - 1).
  • A342389 (program): a(n) = Sum_ k=1..n k^gcd(k,n).
  • A342397 (program): Expansion of the o.g.f. (2x^2 + 3x + 2)x/((x + 1)^2(x - 1)^4).
  • A342410 (program): The binary expansion of a(n) corresponds to that of n where all the 1’s have been replaced by 0’s except in the last run of 1’s.
  • A342448 (program): Partial sums of A066194.
  • A342482 (program): a(n) = n*(2^(n-1) - n - 1).
  • A342568 (program): 1/a(n) is the current through the resistor at the central rung of an electrical ladder network made of 6*n+1 one-ohm resistors, fed by 1 volt at diametrically opposite ends of the ladder.
  • A342661 (program): a(n) = n * sigma(A064989(n)), where A064989 is multiplicative with a(2^e) = 1 and a(p^e) = prevprime(p)^e for odd primes p, and sigma gives the sum of the divisors of its argument.
  • A342673 (program): a(n) = gcd(n, sigma(A003961(n))), where A003961 is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors of n.
  • A342675 (program): a(n) = Sum_ d n d^(n-d+1).
  • A342676 (program): a(n) is the number of lunar primes less than or equal to n.
  • A342709 (program): 12-gonal (dodecagonal) square numbers.
  • A342710 (program): Solutions x to the Pell-Fermat equation x^2 - 5*y^2 = 4.
  • A342711 (program): Partial sums of A000267.
  • A342712 (program): Partial sums of A248333.
  • A342737 (program): Number of wedged n-spheres in the homotopy type of the neighborhood complex of Kneser graph KG_ 3,n .
  • A342761 (program): Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the resulting graph has a(n) edges.
  • A342768 (program): a(n) = A342767(n, n).
  • A342774 (program): Length of n-th word in the ordering A342753 of all binary words.
  • A342831 (program): a(n) is the smallest positive integer k such that the n-dimensional cube [0,k]^n contains at least as many internal lattice points as external lattice points.
  • A342850 (program): Number of sets in the geometry determined by the Hausdorff metric at each location between two sets defined by a complete bipartite graph K(3,n) (with n at least 4) missing three edges, where all three removed edges are incident to different vertices in the 3-point set and none of the removed edges are incident to the same vertex in the other set.
  • A342851 (program): Remove duplicates in the decimal digit-reversal of n.
  • A342856 (program): Factorial numbers n that are sqrt(n)-smooth.
  • A342871 (program): a(n) = Sum_ k=1..n floor(n^(1/k)), n >= 1.
  • A342892 (program): a(n) is the complement of the bit two places to the left of the least significant “1” in the binary expansion of n.
  • A342905 (program): Array read by antidiagonals: T(n,k) = product of all distinct primes dividing n*k (n>=1, k>=1).
  • A342914 (program): Number of grid points covered by a truncated triangle drawn on the hexagonal lattice with the short sides having length n and the long sides length 2*n.
  • A342925 (program): a(n) = A003415(sigma(n)), where A003415 is the arithmetic derivative, and sigma is the sum of divisors of n.
  • A342939 (program): a(n) is the Skolem number of the triangular grid graph T_n.
  • A342940 (program): Triangle read by rows: T(n, k) is the Skolem number of the parallelogram graph P_ n, k , with 1 < k <= n.
  • A342959 (program): Number of 1’s within a sample word of length 10^n of the infinite Fibonacci word A003842 where n is the sequence index.
  • A342977 (program): Decimal expansion of (Pi - 2) / 4.
  • A342994 (program): a(n) = (1000^n - 1)*(220/333).
  • A343005 (program): a(n) is the number of dihedral symmetries D_ 2m (m >= 3) that configurations of n non-overlapping equal circles can possess.
  • A343007 (program): Relative position of the average value between two consecutive partial sums of the Leibniz formula for Pi.
  • A343009 (program): a(n) = (n^(2n)-1)/(n^2-1) for n > 1.
  • A343028 (program): a(n) = floor(11*n / 3).
  • A343069 (program): Decimal expansion of 2(1+5sqrt(2))/7.
  • A343174 (program): Partial sums of paper-folding sequence A014577.
  • A343175 (program): a(0)=2; for n > 0, a(n) = 2^(2*n-1) + 2^n + 1.
  • A343176 (program): a(0)=3; for n > 0, a(n) = 2^(2n) + 32^(n-1) + 1.
  • A343177 (program): a(0)=4; if n >0 is even then a(n) = 2^(n/2+1)+3, otherwise a(n) = 3*(2^((n-1)/2)+1).
  • A343180 (program): Trajectory of 1 under the morphism 1 -> 12, 2 -> 32, 3 -> 14, 4 -> 34.
  • A343199 (program): Decimal expansion of 6+2*sqrt(3).
  • A343265 (program): a(n) is the number of ways n can be reached starting from 0 and using only two operations: adding one or, once n > 1, squaring.
  • A343276 (program): a(n) = n! * [x^n] -x(x + 1)exp(x)/(x - 1)^3.
  • A343291 (program): a(n) = (n-2)*2^(n-1) + n + 2.
  • A343318 (program): a(n) = (2^n + 1)^3.
  • A343442 (program): If n = Product (p_j^k_j) then a(n) = Product (p_j + 2), with a(1) = 1.
  • A343461 (program): a(n) is the maximal number of congruent n-gons that can be arranged around a vertex without overlapping.
  • A343497 (program): a(n) = Sum_ k=1..n gcd(k, n)^3.
  • A343539 (program): a(n) = (2n+1)Lucas(2*n+1).
  • A343543 (program): a(n) = nLucas(2n).
  • A343560 (program): a(n) = (n-1)(4n+1).
  • A343578 (program): a(n) = 32n^2 - 40n + 10.
  • A343586 (program): a(n) = the sum of all the multiples of 2 or 5 less than or equal to 10^n.
  • A343607 (program): Minimal number of colors required for an edge-coloring of the complete graph K_n with no monochromatic triangle.
  • A343608 (program): a(n) = [n/5][n/5 - 1](3n - 10[n/5 + 1])/6, where [.] = floor: upper bound for minimum number of monochromatic triangles in a 3-edge-colored complete graph K_n.
  • A343609 (program): a(n) = floor(n/9).
  • A343638 (program): a(n) = (Sum of decimal digits of 3*n) / 3.
  • A343639 (program): a(n) = (Sum of digits of 9*n) / 9.
  • A343655 (program): Number of pairwise coprime sets of divisors of n, where a singleton is not considered pairwise coprime unless it is 1 .
  • A343720 (program): Triangle read by rows: T(n,k) = k^2 mod n for k = 0..n-1, n >= 1.
  • A343754 (program): a(n) = 0, and for any n > 0, a(n+1) = a(n) - A065363(n) + 1.
  • A343785 (program): a(n) is completely multiplicative with a(p^e) = (-1)^e if p == 2 (mod 3) and a(p^e) = 1 otherwise.
  • A343794 (program): Numbers k such that 630*k + 315 is not an abundant number (A005101).
  • A343808 (program): Partial sums of A062074.
  • A343810 (program): Numbers that contain only the digits 0,4,8. Permutable multiples of 4: numbers k such that every permutation of the digits of k is a multiple of 4.
  • A343842 (program): Series expansion of 1/sqrt(8*x^2 + 1), even powers only.
  • A343859 (program): Partial sums of the primes excluding 3.
  • A343877 (program): Number of pairs (d1, d2) of divisors of n such that d1<d2, d1 n, d2 n, and d1 + d2 <= n.
  • A343910 (program): a(n) = mu(phi(n)), where mu is the Möbius function and phi is the Euler totient function.
  • A343911 (program): a(n) = Omega(phi(n)), where Omega is the number of prime factors of n with multiplicity and phi is the Euler totient function.
  • A343935 (program): Number of ways to choose a multiset of n divisors of n.
  • A343936 (program): Number of ways to choose a multiset of n divisors of n - 1.
  • A343994 (program): Number of nodes in graph BC(n,2) when the internal nodes are counted with multiplicity.
  • A344004 (program): Number of ordered subsequences of 1,…,n containing at least three elements and such that the first differences contain only odd numbers.
  • A344110 (program): Triangle read by rows: T(n,k) = 2^(n*k), n >= 0, 0 <= k <= n.
  • A344111 (program): Decimal expansion of 4 + sqrt(3).
  • A344113 (program): a(n) = 2^(n^2) - n^n.
  • A344128 (program): a(n) = Sum_ k=1..n k * floor(n/k^2).
  • A344150 (program): Length of the n-th word in A342910.
  • A344212 (program): Decimal expansion of 1 + 1/sqrt(5).
  • A344215 (program): a(n) = n*(3^(n-1) - 2^(n-1)).
  • A344259 (program): For any number n with binary expansion (b(1), …, b(k)), the binary expansion of a(n) is (b(1), …, b(ceiling(k/2))).
  • A344260 (program): a(n) is the number of relations from an n-element set into a set of at most n elements.
  • A344327 (program): Number of divisors of n^4.
  • A344337 (program): a(n) = 9^omega(n), where omega(n) is the number of distinct primes dividing n.
  • A344372 (program): a(n) = Sum_ k=1..2n (-1)^k gcd(k,2n).
  • A344387 (program): Decimal expansion of sqrt(17)/4.
  • A344389 (program): a(n) is the number of nonnegative numbers < 10^n with all digits distinct.
  • A344399 (program): a(n) = 4^nbinomial(n - 1/2, -1/2)(n^2 + 1).
  • A344402 (program): a(n) = denominator(R(n,3)), where R(n,d) = (Product_ j prime to d) Pochhammer(j/d, n)) / n!.
  • A344404 (program): a(n) = Sum_ d n floor(n/d^2).
  • A344405 (program): a(n) = Sum_ d n (n/d) * floor(n/d^2).
  • A344478 (program): Number of unitary prime divisors p of n such that n/p is squarefree.
  • A344483 (program): a(n) = n^2 + sigma(n) - n*d(n).
  • A344485 (program): a(n) = Sum_ d n (n-d) * phi(n/d).
  • A344509 (program): a(n) = (1/n) * Sum_ k=1..n k * lcm(k,n).
  • A344510 (program): a(n) = Sum_ k=1..n k * gcd(k,n).
  • A344511 (program): a(n) = Sum_ k >= 0 sign(d_k) * 2^k for any number n with decimal expansion Sum_ k >= 0 d_k * 10^k.
  • A344517 (program): Minimum diameter of 4-regular circulant graphs of order n.
  • A344520 (program): Decimal expansion of 2*(1+sqrt(10))/3.
  • A344526 (program): a(n) = Sum_ k=1..n k^3 * phi(k).
  • A344543 (program): Lexicographically earliest sequence S of distinct positive terms such that the product of the last k digits of S is even, k being the rightmost digit of a(n).
  • A344552 (program): a(n) = Sum_ k=1..n floor(k*(n-k)/n).
  • A344554 (program): Decimal expansion of 2*(1+sqrt(26))/5.
  • A344564 (program): a(n) = [x^n] -3/(2*x - 1)^5.
  • A344568 (program): Decimal expansion of 2*(1+sqrt(82))/9.
  • A344587 (program): a(n) = 2*A003961(n) - sigma(A003961(n)).
  • A344598 (program): a(n) = Sum_ k=1..n phi(k) * (floor(n/k)^2 - floor((n-1)/k)^2).
  • A344617 (program): Sign of the alternating sum of the prime indices of n.
  • A344622 (program): a(n) = n*(n+1)/2 - sigma(n) + d(n).
  • A344624 (program): a(n) = Sum_ k=1..n k^c(k), where c(n) is the characteristic function of squares.
  • A344674 (program): a(n) is the maximum value such that there is an n X n binary orthogonal matrix with every row having at least a(n) ones.
  • A344695 (program): a(n) = gcd(sigma(n), psi(n)), where sigma is the sum of divisors function, A000203, and psi is the Dedekind psi function, A001615.
  • A344747 (program): a(n) = (1/6)*(3^n + (-2)^n - 1).
  • A344791 (program): a(n) is the number of 2-point antichains in the poset D_ 2n+1 of type D, whose elements are compositions of 2n+1.
  • A344814 (program): a(n) = Sum_ k=1..n floor(n/k) * 3^(k-1).
  • A344815 (program): a(n) = Sum_ k=1..n floor(n/k) * 4^(k-1).
  • A344816 (program): a(n) = Sum_ k=1..n floor(n/k) * 5^(k-1).
  • A344853 (program): a(n) = n minus (sum of digits of n in base 3).
  • A344863 (program): a(n) = mu(sigma(n)).
  • A344864 (program): a(n) = mu(d(n)).
  • A344866 (program): Number of polygons formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.
  • A344907 (program): Number of polygon edges formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.
  • A344919 (program): a(n) = n^n - n*(n + 1) / 2.
  • A344953 (program): Positions of words in A341258 that end with 1.
  • A345018 (program): For each n, append to the sequence n^2 consecutive integers, starting from n.
  • A345019 (program): Numbers whose last digit is refactorable.
  • A345021 (program): a(n) is the result of replacing 2’s by 0’s in the hereditary base-2 expansion of n.
  • A345028 (program): a(n) = Sum_ k=1..n 2^(floor(n/k) - 1).
  • A345069 (program): Sums of two consecutive even-indexed primes.
  • A345070 (program): Averages of two consecutive even-indexed primes.
  • A345071 (program): Sums of two consecutive odd-indexed primes.
  • A345089 (program): Averages of two consecutive odd-indexed odd primes.
  • A345108 (program): a(n) = Sum_ k=1..n 2^(n - floor(n/k)).
  • A345110 (program): a(n) is n rotated one place to the left or, equivalently, n with the most significant digit moved to the least significant place, omitting leading zeros.
  • A345111 (program): a(n) = n + A345110(n).
  • A345135 (program): Number of ordered rooted binary trees with n leaves and with minimal Sackin tree balance index.
  • A345211 (program): Numbers with the same number of odd / even, refactorable divisors.
  • A345222 (program): Number of divisors of n with a prime number of divisors.
  • A345280 (program): a(n) = Sum_ p n nextprime(p), where nextprime(n) is the smallest prime > n.
  • A345320 (program): Sum of the divisors of n whose square does not divide n.
  • A345339 (program): a(n) = 18*n + 20.
  • A345360 (program): a(n) = n^n*n - n.
  • A345366 (program): a(n) = (p*q+1) mod (p+q) where p=prime(n) and q=prime(n+1).
  • A345367 (program): a(n) = Sum_ k=0..n binomial(4k,k) / (3k + 1).
  • A345368 (program): a(n) = Sum_ k=0..n binomial(5k,k) / (4k + 1).
  • A345401 (program): a(n) is the unique odd number h such that BCR(h*2^m-1) = 2n (except for BCR(0) = 1) where BCR is bit complement and reverse per A036044.
  • A345455 (program): a(n) = Sum_ k=0..n binomial(5n+1,5k).
  • A345456 (program): a(n) = Sum_ k=0..n binomial(5n+2,5k).
  • A345457 (program): a(n) = Sum_ k=0..n binomial(5n+3,5k).
  • A345458 (program): a(n) = Sum_ k=0..n binomial(5n+4,5k).
  • A345493 (program): Numbers that are the sum of eight squares in six or more ways.
  • A345502 (program): Numbers that are the sum of nine squares in five or more ways.
  • A345504 (program): Numbers that are the sum of nine squares in seven or more ways.
  • A345531 (program): Smallest prime power greater than the n-th prime.
  • A345632 (program): Sum of terms of even index in the binomial decomposition of n^(n-1).
  • A345633 (program): Sum of terms of odd index in the binomial decomposition of n^(n-1).
  • A345668 (program): Last prime minus distance to last prime.
  • A345685 (program): a(n) is the smallest cardinality of all covering sets associated with Riesel number A101036(n).
  • A345701 (program): a(n) = 3*n^3 - 1.
  • A345702 (program): Numbers that can be written as 2a^2 - 1 and 3b^3 - 1.
  • A345727 (program): a(n) = (prime(n)+1) * prime(n+1).
  • A345735 (program): A prime-generating quasipolynomial: a(n) = 6*floor(n^2/4) + 17.
  • A345741 (program): a(n) = n + (n - 1) * d(n).
  • A345745 (program): a(n) = Sum_ k=1..n n^(1 - mu(k)^2).
  • A345867 (program): Total number of 0’s in the binary expansions of the first n primes.
  • A345887 (program): Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the largest cell covered.
  • A345888 (program): a(n) = n + (n - 1) * pi(n).
  • A345889 (program): Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the smallest cell covered.
  • A345890 (program): a(n) = n + (n - 1) * (n - pi(n)).
  • A345891 (program): a(n) = n + (n - 1) * phi(n).
  • A345892 (program): a(n) = n + (n - 1) * (n - phi(n)).
  • A345927 (program): Alternating sum of the binary expansion of n (row n of A030190). Replace 2^k with (-1)^(A070939(n)-k) in the binary expansion of n (compare to the definition of A065359).
  • A345963 (program): a(n) = (q^2-q+1)/3 where q = 2^(2*n+1) = A004171(n).
  • A345981 (program): a(n) = integral spum of a path P_n.
  • A346004 (program): If n even then n otherwise ((n+1)/2)^2.
  • A346065 (program): a(n) = Sum_ k=0..n binomial(6k,k) / (5k + 1).
  • A346070 (program): Symbolic code for the corner turns in the Lévy dragon curve.
  • A346122 (program): n times the n-th digit of the decimal expansion of Pi.
  • A346155 (program): Partial sums of A007978.
  • A346174 (program): Inverse binomial transform of A317614.
  • A346178 (program): Expansion of (1-2x)/(1-10x).
  • A346197 (program): a(n) is the minimum number of pebbles such that any assignment of those pebbles on K_5 is a next-player winning game in the two-player impartial (n+1,n) pebbling game.
  • A346232 (program): Maximum number of squares in a square grid whose interiors can be touched by a (possibly skew) line segment of length n.
  • A346234 (program): Dirichlet inverse of A003961.
  • A346295 (program): a(n) = Sum_ k=0..n (2^k + 1) * (2^k + 2) / 2.
  • A346301 (program): Positions of words in A076478 such that first digit = last digit.
  • A346302 (program): Positions of words in A076478 such that first digit != last digit.
  • A346303 (program): Positions of words in A076478 that start with 0 and end with 0.
  • A346304 (program): Positions of words in A076478 that start with 1 and end with 0.
  • A346305 (program): Positions of words in A076478 that start with 1 and end with 1.
  • A346306 (program): Position in A076478 of the binary complement of the n-th word in A076478.
  • A346307 (program): Number of runs in the n-th word in A076478.
  • A346311 (program): Maximum number of edges a single edge crosses in a drawing of the complete graph K_n where every vertex lies on the outer face.
  • A346370 (program): Upper bound for the number of solutions of the TRINTUM cube puzzle n X 1 X 1 (cuboid formed by 4n + 2 parts) different by the set of parts, which are distinguished by the amount of surface area they contribute to the assembled cuboid.
  • A346376 (program): a(n) = n^4 + 14n^3 + 63n^2 + 98*n + 28.
  • A346388 (program): a(n) is the number of proper divisors of A053742(n) ending with 5.
  • A346403 (program): a(1)=1; for n>1, a(n) gives the sum of the exponents in the different ways to write n as n = x^y, 2 <= x, 1 <= y.
  • A346425 (program): a(n) is the greatest number k such that k! <= prime(n).
  • A346432 (program): a(0) = 1; a(n) = n! * Sum_ k=0..n-1 (n-k+1) * a(k) / k!.
  • A346494 (program): Heptagonal numbers (A000566) with prime indices (A000040).
  • A346502 (program): a(n) = 3n - (sum of digits of 3n in base 3).
  • A346513 (program): a(n) = Fibonacci(n+1)^3 - Fibonacci(n)^3.
  • A346514 (program): a(n) = n^4 + 28n^3 + 252n^2 + 784*n + 448.
  • A346515 (program): a(n) = n(n+2)(n+4)(n+6)(n+8)(n+10)(n+12)*(n+14).
  • A346563 (program): a(n) = n + A007978(n).
  • A346597 (program): Partial sums of A019554.
  • A346629 (program): Number of n-digit positive integers that are the product of two integers ending with 2.
  • A346633 (program): Sum of even-indexed parts (even bisection) of the n-th composition in standard order.
  • A346663 (program): The number of nonreal roots of Sum_ k=0..n prime(k+1)*x^k.
  • A346671 (program): a(n) = Sum_ k=0..n binomial(7k,k) / (6k + 1).
  • A346672 (program): a(n) = Sum_ k=0..n binomial(8k,k) / (7k + 1).
  • A346693 (program): Minimum integer length of a segment that touches the interior of n squares on a unit square grid.
  • A346759 (program): a(n) = Sum_ d n floor(d^2/4).
  • A346796 (program): Number of equivalence classes of triangles in an n-dimensional hypercube, equivalent up to translation of difference vectors corresponding to edges.
  • A346804 (program): Numbers that are the sum of ten squares in five or more ways.
  • A346806 (program): Numbers that are the sum of ten squares in seven or more ways.
  • A346808 (program): Numbers that are the sum of ten squares in ten or more ways.
  • A346865 (program): Sum of divisors of the n-th hexagonal number.
  • A346866 (program): Sum of divisors of the n-th second hexagonal number.
  • A346869 (program): Sum of all divisors, except the smallest and the largest of every number, of the first n odd numbers.
  • A346870 (program): Sum of all divisors, except the smallest and the largest of every number, of the first n positive even numbers.
  • A346877 (program): Sum of the divisors, except the largest, of the n-th odd number.
  • A346878 (program): Sum of the divisors, except the largest, of the n-th positive even number.
  • A346879 (program): Sum of the divisors, except the smallest and the largest, of the n-th odd number.
  • A346880 (program): Sum of the divisors, except the smallest and the largest, of the n-th positive even number.
  • A346896 (program): E.g.f.: (1-12*x)^(-11/12).
  • A346912 (program): a(0) = 1; a(n) = a(n-1) + a(floor(n/2)) + 1.
  • A346949 (program): Value of the permanent of the matrix [1-zeta^ j-k ]_ 1<=j,k<=2n , where zeta is any primitive 2n-th root of unity.
  • A347017 (program): a(n) = floor(2^(n-1)) - binomial(n,3) + binomial(n,2) - n + 1.
  • A347026 (program): Irregular triangle read by rows in which row n lists the first n odd numbers, followed by the first n odd numbers in decreasing order.
  • A347047 (program): Smallest squarefree semiprime whose prime indices sum to n.
  • A347112 (program): a(n) = concat(prime(n+1),n) mod prime(n).
  • A347153 (program): Sum of all divisors, except the largest of every number, of the first n odd numbers.
  • A347154 (program): Sum of all divisors, except the largest of every number, of the first n positive even numbers.
  • A347191 (program): Number of divisors of n^2-1.
  • A347274 (program): a(n) = Sum_ j=1..n j*n^(n+1-j).
  • A347342 (program): a(n) = prime(n) mod floor(prime(n) / n).
  • A347350 (program): Sequence obtained by writing the first 4 integers and skipping 1, then writing the next 5 integers and skipping 2, then writing the next 6 and skipping 3, etc.
  • A347400 (program): Lexicographically earliest sequence of distinct terms > 0 such that concatenating n to a(n) forms a palindrome in base 10.
  • A347478 (program): Number of total dominating sets in the n-alkane graph.
  • A347501 (program): Number of dominating sets in the n-alkane graph.
  • A347512 (program): Number of minimal dominating sets in the n-book graph.
  • A347513 (program): Number of minimal dominating sets in the n-cycle complement graph.
  • A347523 (program): Characteristic function of nonpowers of 2.
  • A347532 (program): a(n) is the sum of the nonpowers of 2 in the 3x+1 sequence that starts at n.
  • A347535 (program): Number of minimum dominating sets in the complete bipartite graph K_n,n.
  • A347536 (program): Number of minimum dominating sets in the complete tripartite graph K_n,n,n.
  • A347553 (program): Number of minimum dominating sets in the n-cycle complement graph.
  • A347581 (program): The Barnyard sequence: a(n) is the minimum number of unit length line segments required to enclose areas of 1 through n on a square grid.
  • A347611 (program): a(n) is the n-th n-factorial number: a(n) = n!_n.
  • A347616 (program): a(n) = Sum_ k=1..n k^Omega(k).
  • A347671 (program): a(n) = n^n mod 100.
  • A347677 (program): Number of Baxter matrices of size 3 X n that contain n+2 1’s.
  • A347725 (program): Number of irredundant sets in the (2n-1)-triangular snake graph (for n > 1).
  • A347870 (program): a(n) = A003415(sigma(n)) mod 2, where A003415 is the arithmetic derivative, and sigma is the sum of divisors of n.
  • A347871 (program): a(n) = (n+A003415(sigma(n))) mod 2, where A003415 gives the arithmetic derivative of its argument.
  • A347912 (program): a(n) = Sum_ k=1..n k - floor(sqrt(k)+1/2) * floor(sqrt(k-1)).
  • A348161 (program): Number of factorizations of (n,n) into one or two pairs (i,j) with i > 0, j > 0 (and if i=1 then j=1).