Summary of block A281
Sequences in block A281
Section titled “Sequences in block A281”-
A281026: a(n) = floor(3*n*(n+1)/4).
-
A281151: a(n) = floor(4*n*(n+1)/5).
-
A281166: a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) for n>2, a(0)=a(1)=1, a(2)=3.
-
A281200: Number of n X 3 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
-
A281234: Solutions y to the negative Pell equation y^2 = 72*x^2 - 288 with x,y >= 0.
-
A281237: Solutions x to the negative Pell equation y^2 = 72*x^2 - 73728 with x,y >= 0.
-
A281333: a(n) = 1 + floor(n/2) + floor(n^2/3).
-
A281362: a(0) = 1, a(1) = 2; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2).
-
A281375: a(n) = floor(2^(n+1)/n).
-
A281381: a(n) = n*(n + 1)*(4*n + 5)/2.
-
A281387: Pairs (x, y) of relatively prime positive integers such that (x^2 - 5)/y and (y^2 - 5)/x are both positive integers.
-
A281445: Nonnegative k for which (2*k^2 + 1)/11 is an integer.
-
A281476: Maximum length of binary (sign) sequences with corresponding peak sidelobe level.
-
A281481: a(n) = 2^(n - 1) * (2^n + 1) + 1.
-
A281482: a(n) = 2^(n + 1) * (2^n + 1) - 1.
-
A281500: Reduced denominators of f(n) = (n+1)/(2^(2+n)-2) with A026741(n+1) as numerators.
-
A281529: a(n) = least denominator Y of any proper fraction X/Y which needs n or more terms to be written as a signed sum of distinct unit fractions.
-
A281532: a(n) = least numerator X such that the proper fraction X/A281529(n) needs n or more terms to be written as a signed sum of distinct unit fractions.
-
A281546: a(n) = 27*n + 2.
-
A281576: Composite Fermat numbers.
-
A281660: The least common multiple of 1+n and 1+n^2.
-
A281698: a(n) = 5*2^(n-1) + 2^(2*n-1) + 6^n + 1.
-
A281699: Sierpinski stellated octahedron numbers: a(n) = 2*(-3*2^(n+1) + 2^(2n+3) + 5).
-
A281701: a(n) is the largest number of coins obtainable by making repeated moves in this puzzle: Start with 1 coin in each of n boxes B(i), i=1..n. One can iterate moves of two types: (1) remove a coin from a nonempty B(i) (i <= n-1) and place two coins in B(i+1); (2) remove a coin from a nonempty B(i) (i <= n-2) and switch the contents of B(i+1) and B(i+2).
-
A281705: Number of Hangul letters (initials, medials and finals of syllables) in Native Korean name of n.
-
A281773: Number of distinct topologies on an n-set that have exactly 4 open sets.
-
A281813: a(0) = 3, a(n) = 8*n + 4 for n > 0.
-
A281863: Alternating powers of 60 and 10 times powers of 60.
-
A281899: a(n) = n + 6*floor(n/3).
-
A281910: Minimum possible absolute value over all coefficients of p(x)/(1-x)^n, where p is a power series with +-1 coefficients.
-
A281997: a(n) = (n-1)^n * n^n.