Decomposition into weight × level + jump - all 2D graphs

"Flag numbers": number of dots that can be arranged in successive rows of K, K-1, K, K-1, K, ..., K-1, K (assuming there is a total of L > 1 rows of size K > 1).

A053726(n) = A000000(n) * A000000(n) + A000000(n)

Sum of first n composite numbers.

A053767(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that sum of divisors of n less than n is odd.

A053868(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that n^2 contains exactly 4 different digits.

A054032(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that n concatenated with n-1 is prime.

A054211(n) = A000000(n) * A000000(n) + A000000(n)

Primes p with property that p concatenated with its emirp p' (prime reversal) forms a palindromic prime of the form 'primemirp' (rightmost digit of p and leftmost digit of p' are blended together - p and p' palindromic allowed).

A054217(n) = A000000(n) * A000000(n) + A000000(n)

Partial sums of Kolakoski sequence A000002.

A035336(n) = A000000(n) * A000000(n) + A000002(n+1)

Beatty sequence for e/(e-1); complement of A022843.

A054385(n) = A000000(n) * A000000(n) + A000000(n)

Numbers that are the sum of a positive square and a positive cube in more than one way.

A054402(n) = A000000(n) * A000000(n) + A000000(n)

Let S = {1,5,9,13,..., 4n+1, ...} and call p in S an S-prime if p>1 and the only divisors of p in S are 1 and p; sequence gives elements of S that are not S-primes.

A054520(n) = A000000(n) * A000000(n) + A000000(n)