Summary of block A274
Sequences in block A274
Section titled “Sequences in block A274”-
A274009: 1’s distance from a number in its binary expansion.
-
A274022: Primes of the form 2^(2^k) + 3.
-
A274047: Diameter of Generalized Petersen Graph G(n, 2).
-
A274070: Integer part of the sum of the inverses of the first n primes.
-
A274072: a(n) = 5^n-(-1)^n.
-
A274073: a(n) = 6^n-(-1)^n.
-
A274074: a(n) = 6^n+(-1)^n.
-
A274077: a(n) = n^3 + 4.
-
A274089: Numbers repeated except that powers of 2 only appear once.
-
A274103: Erroneous version of A003323.
-
A274119: a(n) = (Product_{i=0..4}(i*n+2) - Product_{i=0..4}(-i*n-1))/(4*n+3).
-
A274136: a(n) = (n+1)*(2*n+2)!/(n+2).
-
A274221: List of quadruples: 3*n*(3*n-1), 3*n*(3*n+1), (3*n+1)^2, (3*n+2)^2.
-
A274230: Number of holes in a sheet of paper when you fold it n times and cut off the four corners.
-
A274232: Number of partitions of 2^n into at most three parts.
-
A274265: a(n) = (3*n - 1)^(n-1).
-
A274267: a(n) = (4*n - 1)^(n-1).
-
A274269: a(n) = (5*n - 1)^(n-1).
-
A274290: Arising in solving the keyboard problem.
-
A274304: A bisection of A002866.
-
A274306: a(n) = Product_{k=1..n} (4*k^4+1).
-
A274323: Number of partitions of n^4 into at most two parts.
-
A274324: Number of partitions of n^3 into at most two parts.
-
A274325: Number of partitions of n^5 into at most two parts.
-
A274326: Number of distinct irregular n-gon flexagons.
-
A274332: Team size n for which there exists a balanced tournament for 2n+1 players so that in 2n+1 matches each player plays exactly n-1 times with and n times against each other player.
-
A274337: Numbers n such that 2^n is not the sum of 5 positive cubes.
-
A274339: The period 3 sequence of the iterated sum of deficient divisors function (A187793) starting at 15.
-
A274384: Numbers n such that 2^n is not the average of three positive cubes.
-
A274406: Numbers m such that 9 divides m*(m + 1).
-
A274497: Sum of the degrees of asymmetry of all binary words of length n.
-
A274499: Sum of the degrees of asymmetry of all ternary words of length n.
-
A274520: a(n) = ((1 + sqrt(7))^n - (1 - sqrt(7))^n)/sqrt(7).
-
A274526: a(n) = ((1 + sqrt(11))^n - (1 - sqrt(11))^n)/sqrt(11).
-
A274543: Smallest number m such that every binary string of length >= m contains either an n-th power or n-th antipower.
-
A274576: a(2n) = floor(n/2), a(2n+1) = a(n), a(0)=0.
-
A274583: Expansion of (1 + x + x^2 - x^3 - x^4 + x^6)/((1 - x)^3*(1 + x + x^2)^2).
-
A274616: Maximal number of non-attacking queens on a right triangular board with n cells on each side.
-
A274638: Main diagonal of A274637.
-
A274681: Numbers k such that 4*k + 1 is a triangular number.
-
A274702: a(n) = number of arrangements of n circles in the affine plane in which all circles share part of their boundary with the boundary of the union of all the circles.
-
A274743: Repunits with odd indices multiplied by 99, i.e., 99*(1, 111, 11111, 1111111, …).
-
A274755: Repunits with even indices multiplied by 99, i.e., 99*(11, 1111, 111111, 11111111, …).
-
A274757: Numbers k such that 6*k+1 is a triangular number (A000217).
-
A274772: Zero together with the partial sums of A056640.
-
A274817: a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4) for n>3, a(0)=1, a(1)=-1, a(2)=4, a(3)=8.
-
A274822: Total number of regions in all arrangements of n circles in the affine plane, including the regions that do not belong to the circles.
-
A274823: Total number of regions in all arrangements of n circles in the affine plane, excluding the regions that do not belong to the circles.
-
A274830: Numbers k such that 7*k+1 is a triangular number (A000217).
-
A274922: a(n) = (-1)^n * n if n>0, a(0) = 1.
-
A274973: Centered cubohemioctahedral numbers: a(n) = 2*n^3+9*n^2+n+1.
-
A274974: Centered octahemioctahedral numbers: a(n) = (4*n^3+24*n^2+8*n+3)/3.
-
A274977: a(n) = a(n-1) + 3*a(n-2) with n>1, a(0)=1, a(1)=6.
-
A274978: Integers of the form m*(m + 6)/7.
-
A274979: Integers of the form m*(m + 7)/8.
-
A274981: Decimal expansion of gamma(2) = 7/5.