Summary of block A257
Sequences in block A257
Section titled “Sequences in block A257”-
A257042: a(n) = (3*n+7)*n^2.
-
A257055: a(n) = n*(n + 1)*(n^2 - n + 3)/6.
-
A257063: Number of length 1 1..(n+1) arrays with every leading partial sum divisible by 2 or 3.
-
A257075: a(n) = (-1)^(n mod 3).
-
A257076: Expansion of (1 - x^3) / (1 - x + x^2) in powers of x.
-
A257083: Partial sums of A257088.
-
A257088: a(2*n) = 4*n if n>0, a(2*n + 1) = 2*n + 1, a(0) = 1.
-
A257143: a(2*n) = 3*n if n>0, a(2*n + 1) = 2*n + 1, a(0) = 1.
-
A257145: a(n) = 5 * floor( (n+2) / 5) - n with a(0) = 1.
-
A257164: Period 5 sequence: repeat [0, 2, 4, 1, 3].
-
A257170: Expansion of (1 + x) * (1 + x^3) / (1 + x^4) in powers of x.
-
A257175: The smallest m such that the m-th triangular number is greater than or equal to half the n-th triangular number.
-
A257179: Expansion of (1 + x^5) / ((1 - x) * (1 + x^4)) in powers of x.
-
A257198: Number of permutations of length n having exactly one descent such that the first element of the permutation is an odd number.
-
A257272: a(n) = 2^(n-1)*(2^n+7).
-
A257273: a(n) = 2^(n-1)*(2^n+3).
-
A257285: a(n) = 4*5^n - 3*4^n.
-
A257352: G.f.: (1-2*x+51*x^2)/(1-x)^3.
-
A257401: God’s number for a Rubik’s cube of size n X n X n (using the half turn metric).
-
A257418: Number of pieces after a sheet of paper is folded n times and cut diagonally.
-
A257448: a(n) = 13*(2^n - 1) - 3*n^2 - 9*n.
-
A257479: Maximal kissing number in n dimensions: maximal number of unit spheres that can touch another unit sphere.
-
A257481: Consider a hole-less cluster of n circles in the hexagonal lattice packing of circles; a(n) is the maximal number of circles that touch 6 circles.
-
A257487: Expansion of ( -4+15*x-8*x^2 ) / ( (x-1)*(x^2-4*x+1) ).
-
A257496: Doubly prime home primes (DPHP).
-
A257531: If 2^(n-1) mod n = 1, then 1 else 0.
-
A257542: Square-sum pairs: Numbers n such that 0,1, …, 2n-1 can be partitioned into n pairs, where each pair adds up to a perfect square.
-
A257555: Number of distinct ways to dissect a cube into n rectangular boxes of equal volume, up to reflection and rotation.
-
A257564: Irregular triangle read by rows: T(n,k) = r(n+k)+r(n-k) with r(n) = (n-(n mod 2))/2 for n>=0 and -n<=k<=n.
-
A257583: a(0)=4; thereafter a(n)=8*n*(2*n-1)*a(n-1).
-
A257589: a(n) = (2n+1)^2*Catalan(n).
-
A257594: Consider the hexagonal lattice packing of circles; a(n) is the maximal number of circles that can be enclosed by a closed chain of n circles.
-
A257645: a(n) = 15*n + 14.
-
A257844: a(n) = floor(n/4) * (n mod 4).
-
A257845: a(n) = floor(n/5) * (n mod 5).
-
A257846: a(n) = floor(n/6) * (n mod 6).
-
A257847: a(n) = floor(n/7) * (n mod 7).
-
A257848: a(n) = floor(n/8) * (n mod 8).
-
A257849: a(n) = floor(n/9) * (n mod 9).
-
A257850: a(n) = floor(n/10) * (n mod 10).
-
A257857: Sequentially filled binary triangle rotated 180 degrees and then superimposed and added to the original triangle.
-
A257923: Number of prime factors of the n-th Giuga number A007850(n).
-
A257925: a(n) = (n^2 - n + 1)*(n^2 + n - 1).
-
A257936: Decimal expansion of 11/18.
-
A257942: a(n) = (n+1)*(n+2)/A014695(n+1), where A014695 is repeat (1, 2, 2, 1).
-
A257970: a(1) = 1, a(2) = 2, a(3) = 5; thereafter a(n) = 2 * Sum_{k=1..n-1} a(k).