Summary of block A295
Sequences in block A295
Section titled “Sequences in block A295”-
A295077: a(n) = 2*n*(n-1) + 2^n - 1.
-
A295089: a(n) = 3*n^2 + n + 3.
-
A295130: a(n) = 3*n*(64*n^2 + 1).
-
A295266: Positive integers whose squares can be represented as the sum or difference of 3-smooth numbers.
-
A295282: a(n) > n is chosen to minimize the difference between ratios a(n):n and n:(a(n) - n), so that they are matching approximations to the golden ratio.
-
A295288: Binomial transform of the centered triangular numbers A005448.
-
A295334: Denominators of continued fraction convergents to sqrt(10)/2 = sqrt(5/2) = A020797 + 1.
-
A295340: Numbers congruent to 11 or 13 mod 15.
-
A295383: a(n) = (2*n)! * [x^(2*n)] (-x/(1 - x))^n/((1 - x)*n!).
-
A295391: a(1) = 2; a(n+1) = 1 + (a(n)^2 - a(n))*(1+1/n) for n >= 1.
-
A295429: Number of minimal connected dominating sets in the n X n torus grid graph.
-
A295473: a(0) = 0; for n>0, a(n) = 9*n!.
-
A295484: Numbers that have exactly one representation as a sum of six nonnegative squares.
-
A295485: Numbers that have exactly two representations as a sum of six nonnegative squares.
-
A295486: Numbers that have exactly three representations as a sum of six nonnegative squares.
-
A295487: Numbers that have exactly four representations as a sum of six nonnegative squares.
-
A295488: Numbers that have exactly five representations as a sum of six nonnegative squares.
-
A295491: Numbers that have exactly eight representations as a sum of six nonnegative squares.
-
A295523: Nonprime numbers n such that A243822(n) >= A243823(n).
-
A295579: Maximal value of a length-n “minimal good sequence” in the sense of Cavenagh et al. (2006).
-
A295581: Maximal value of a length-n “minimal cyclically good sequence” in the sense of Cavenagh et al. (2006).
-
A295619: a(n) = a(n-1) + 3*a(n-2) - 2*a(n-3) - 2*a(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4.
-
A295622: Number of nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation.
-
A295643: Squares repeated 4 times; a(n) = floor(n/4)^2.
-
A295674: a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 4, a(3) = 8.
-
A295680: a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 0, a(2) = 0, a(3) = 2.
-
A295699: Numbers that have exactly nine representations as a sum of six positive squares.
-
A295723: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 1, a(2) = 2, a(3) = 3.
-
A295724: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = 1, a(3) = 2.
-
A295725: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = -1, a(3) = 1.
-
A295730: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -1, a(1) = 0, a(2) = 0, a(3) = 1.
-
A295742: Numbers that have exactly two representations of a sum of seven nonnegative squares.
-
A295743: Numbers that have exactly three representations of a sum of seven nonnegative squares.
-
A295744: Numbers that have exactly four representations of a sum of seven nonnegative squares.
-
A295745: Numbers that have exactly five representations of a sum of seven nonnegative squares.
-
A295747: Numbers that have exactly six representations of a sum of seven nonnegative squares.
-
A295748: Numbers that have exactly seven representations of a sum of seven nonnegative squares.
-
A295749: Numbers that have exactly eight representations of a sum of seven nonnegative squares.
-
A295750: Numbers that have exactly nine representations of a sum of seven nonnegative squares.
-
A295751: Numbers that have exactly ten representations as a sum of seven nonnegative squares.
-
A295771: a(n) is the minimum size of a planar additive basis for the square [0,n]^2.
-
A295774: a(n) is the minimum size of a restricted planar additive basis for the square [0,2n]^2.
-
A295796: The only integers that cannot be partitioned into a sum of seven positive squares.
-
A295799: Numbers that have exactly two representations as a sum of seven positive squares.
-
A295802: Numbers that have exactly five representations as a sum of seven positive squares.
-
A295803: Numbers that have exactly six representations as a sum of seven positive squares.
-
A295806: Numbers that have exactly nine representations as a sum of seven positive squares.
-
A295807: Numbers that have exactly ten representations as a sum of seven positive squares.
-
A295821: Number of coprime pairs (a,b) with -n <= a <= n, -2 <= b <= 2.
-
A295838: Largest value corresponding to a string of n printable ASCII characters.
-
A295856: a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = 3, a(3) = 1.
-
A295869: Numbers not divisible by 2, 3 or 5 (A007775) with digital root 8.
-
A295890: a(n) = 1 if binary weights of n and 3n have different parity, 0 otherwise; a(n) = A010060(n) XOR A010060(3n).
-
A295896: a(n) = 1 if there are no odd runs of 1’s in the binary expansion of n followed by a 0 to their right, 0 otherwise.
-
A295904: Number of (not necessarily maximal) cliques in the n-sun graph.
-
A295905: Number of (not necessarily maximal) cliques in the n X n knight graph.
-
A295906: Number of (not necessarily maximal) cliques in the n X n king graph.
-
A295911: Number of (not necessarily maximal) cliques in the n-Hanoi graph.
-
A295933: Number of (not necessarily maximal) cliques in the n-Sierpinski gasket graph.