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

Numbers n such that m + (sum of digits in base-4 representation of m) = n has exactly two solutions.

A230634(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly one solution.

A230853(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly two solutions.

A230854(n) = A000000(n) * A000000(n) + A000000(n)

Complement of A056875.

A232054(n) = A000000(n) * A000000(n) + A000000(n)

In balanced ternary notation, either a palindrome or becomes a palindrome if trailing 0's are omitted.

A233010(n) = A000000(n) * A000000(n) + A000000(n)

Primes p with prime(p) - p + 1 also prime.

A234695(n) = A000000(n) * A000000(n) + A000000(n)

Numbers which are factored to a different set of primes in Z as to the irreducible polynomials in GF(2)[X].

A235033(n) = A000000(n) * A000000(n) + A000000(n)

Numbers whose prime divisors, when multiplied together without carry-bits (as encodings of GF(2)[X]-polynomials, with A048720), produce the original number; numbers for which A234741(n) = n.

A235034(n) = A000000(n) * A000000(n) + A000000(n)

Numbers n for which A234742(n) = n: numbers n whose binary representation encodes a GF(2)[X]-polynomial such that when its irreducible factors are multiplied together as ordinary integers (with carry-bits), the result is n.

A235035(n) = A000000(n) * A000000(n) + A000000(n)

Numbers k such that k*(k+1) - prime(k) is prime.

A235592(n) = A000000(n) * A000000(n) + A000000(n)