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

Numbers n such that totient(n) < cototient(n).

A054741(n) = A000000(n) * A000000(n) + A000000(n)

First term of balanced prime quartets: p(m+1)-p(m) = p(m+2)-p(m+1) = p(m+3)-p(m+2).

A054800(n) = A000000(n) * A000000(n) + A000000(n)

Numbers of the form 2^(2i+1)*(8*j+7).

A055039(n) = A000000(n) * A000000(n) + A000000(n)

Numbers of the form 3^(2i+1)*(3*j+2).

A055040(n) = A000000(n) * A000000(n) + A000000(n)

Numbers of the form 9^i*(3*j+2).

A055048(n) = A000000(n) * A000000(n) + A000000(n)

Sum of a square and a nonnegative cube in more than one way.

A055393(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n for which sigma(n^2) is prime.

A055638(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n that are congruent to +-1 mod 9.

A056020(n) = A000000(n) * A000000(n) + A010697(n+1)

Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 1.

A056231(n) = A000000(n) * A000000(n) + A000000(n)

Form an array with 3 rows: row 1 begins with 1; all rows are increasing; each entry is sum of 2 entries above it; each number appears at most once; smallest unused number is appended to first row if possible. Sequence gives row 2.

A056232(n) = A000000(n) * A000000(n) + A000000(n)