# Programs for A350000-A399999

List of integer sequences with links to LODA programs.

- A350008 (program): a(n) = Sum_{k=0..n} k^(2*k).
- A350042 (program): Sum of all the parts in the partitions of n into 3 positive integer parts.
- A350050 (program): a(n) = (2*n^4 - 6*(-1)^n*n^2 - 2*n^2 + 3*(-1)^n - 3)/96.
- A350051 (program): Part three of the trisection of A017101: a(n) = 19 + 24*n.
- A350090 (program): a(n) is the number of indices i in the range 0 <= i <= n-1 such that A003215(n) - A003215(i) is an oblong number (A002378), where A003215 are the hex numbers.
- A350091 (program): a(n) = a(floor(n/4)) for n == 2 (mod 4), otherwise n.
- A350094 (program): a(n) = Sum_{k=0..n} n CNIMPL k where CNIMPL = NOT(n) AND k is the bitwise logical converse non-implication operator (A102037).
- A350102 (program): Number of self-measuring subsets of the initial segment of the natural numbers strictly below n. Number of subsets S of [n] with S = distset(S).
- A350104 (program): a(n) = Sum_{k=0..n} A350102(k).
- A350107 (program): a(n) = Sum_{k=1..n} k * floor(n/k)^2.
- A350108 (program): a(n) = Sum_{k=1..n} k * floor(n/k)^3.
- A350109 (program): a(n) = Sum_{k=1..n} k * floor(n/k)^n.
- A350116 (program): Number of ways to partition the set of vertices of a convex {n+8}-gon into 3 non-intersecting polygons.
- A350123 (program): a(n) = Sum_{k=1..n} k^2 * floor(n/k)^2.
- A350124 (program): a(n) = Sum_{k=1..n} k^2 * floor(n/k)^3.
- A350125 (program): a(n) = Sum_{k=1..n} k^2 * floor(n/k)^n.
- A350128 (program): a(n) = Sum_{k=1..n} k^n * floor(n/k)^2.
- A350134 (program): Number of endofunctions on [n] with at least one isolated fixed point.
- A350143 (program): a(n) = Sum_{k=1..n} floor(n/(2*k-1))^2.
- A350144 (program): a(n) = Sum_{k=1..n} floor(n/(2*k-1))^3.
- A350145 (program): a(n) = Sum_{k=1..n} floor(n/(2*k-1))^n.
- A350146 (program): Partial sums of A002131.
- A350159 (program): Number of subgroups of the dicyclic group Dic_n.
- A350168 (program): Count from 0 to 1st prime 2, then from 0 to 2nd prime 3, then from 0 to 3rd prime 5, etc …
- A350171 (program): Add 1 to the 1st prime, then write the 2nd prime, then add 1 to the 3rd prime, then write the 4th prime, etc., alternately adding a 1 or not.
- A350172 (program): Start from 1st prime 2, and write it twice, then add 3 to get 5 and write it 3 times, then add 5 to get 10 and write it 5 times, and so on.
- A350173 (program): Write the square of 1st prime, then the 2nd prime, then the square of 3rd prime, alternately squaring or not.
- A350286 (program): Number of different ways to partition the set of vertices of a convex (n+11)-gon into 4 nonintersecting polygons.
- A350294 (program): a(n) = floor(n*2^n/(n + 1)).
- A350295 (program): 2nd subdiagonal of the triangle A350292.
- A350303 (program): a(n) is the number of ways to partition the set of vertices of a convex (n+14)-gon into 5 nonintersecting polygons.
- A350327 (program): Maximum domination number of connected graphs with n vertices and minimum degree 2.
- A350361 (program): 2-tone chromatic number of a tree with maximum degree n.
- A350362 (program): 2-tone chromatic number of an n-cycle.
- A350389 (program): a(n) is the largest unitary divisor of n that is an exponentially odd number (A268335).
- A350395 (program): Numbers m such that a term with the largest coefficient in Product_{k=1..m} (1 + x^k) is unique.
- A350396 (program): Numbers m such that there are two or more terms with the largest coefficient in Product_{k=1..m} (1 + x^k).
- A350471 (program): The number of days elapsed since the Gregorian date Sunday, December 31, 1 BC on 1/1/n, where 1/1/n is the Gregorian date in the format month/day/year, the New Year’s Day of the year n.
- A350498 (program): Convolution of triangular numbers with every third number of Narayana’s Cows sequence.
- A350509 (program): a(n) = n/A055874(n).
- A350520 (program): The number of degree-n^2 polynomials over Z/2Z that can be written as f(f(x)) where f is a polynomial.
- A350551 (program): Convolution of Jacobsthal numbers and Pell numbers.
- A350576 (program): a(n) = n/A055874(n) - A055874(n).
- A350634 (program): Products of the parts s,t in each partition of k (= 2,3,..) into two parts, ordered by increasing k and then by increasing values of s*t (see example).