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

Home

Decomposition of A077477

Least positive integers not excluded by the rule that if n is present then 2n+1 and 3n+1 are not allowed.
A077477(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A077477 - 9997 dots.

Decomposition of A077654

Composite n such that 2n+1 is also composite.
A077654(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A077654 - 9998 dots.

Decomposition of A077717

Primes which can be expressed as sum of distinct powers of 3.
A077717(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A077717 - 9983 dots.

Decomposition of A078180

a(n) = smallest integer that can't be written as p*a(i)+1, for any prime p and 0 a(n-1).
A078180(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A078180 - 9997 dots.

Decomposition of Non-oblong numbers

Non-oblong numbers: Complement of A002378.
A078358(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of Non-oblong numbers - 9998 dots.

Decomposition of A078494

Primes occurring only once in their decade.
A078494(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A078494 - 9999 dots.

Decomposition of A078633

Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.
A078633(n) = A000000(n) * A000000(n) + A237347(n)
Decomposition of A078633 - 9998 dots.

Decomposition of A078649

Numbers n such that A000002(n)=A000002(n+1) where A000002 is the Kolakoski sequence.
A078649(n) = A000000(n) * A000000(n) + A000000(n)
Decomposition of A078649 - 9997 dots.