Summary of block A240
Sequences in block A240
Section titled “Sequences in block A240”-
A240001: Number of 2 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.
-
A240025: Characteristic function of quarter squares, cf. A002620.
-
A240091: a(n) = (10^n - 1)^n.
-
A240114: Maximal number of points that can be placed on a triangular grid of side n so that no three of them are vertices of an equilateral triangle in any orientation.
-
A240129: Triangular numbers that are squares of triangular numbers.
-
A240137: Sum of n consecutive cubes starting from n^3.
-
A240277: Minimal number of people such that exactly n days are required to spread gossip.
-
A240434: Binomial transform of the sum of the first n even squares (A002492).
-
A240438: Greatest minimal difference between numbers of adjacent cells in a regular hexagonal honeycomb of order n with cells numbered from 1 through the total number of cells, the order n corresponding to the number of cells on one side of the honeycomb.
-
A240440: Number of ways to place 3 points on a triangular grid of side n so that they are not vertices of an equilateral triangle of any orientation.
-
A240443: Maximal number of points that can be placed on an n X n square grid so that no four of them are vertices of a square with any orientation.
-
A240506: Number of length-n gap-free words on {1,2,3}.
-
A240523: a(n) = floor(4^n/((1+sqrt(5))/2)^(2*n)).
-
A240530: a(n) = 4*(2*n)! / (n!)^2.
-
A240571: a(n) = round(n^n/n!) where round(1/2)=0.
-
A240670: Numbers n for which all exponents in the prime power factorization of (2*n)! are odious (A000069).
-
A240748: Numbers n such that n^k - (n-1)^k - … - 3^k - 2^k - 1 is prime for some k.
-
A240767: Numbers n such that n^k + (n-1)^k + … + 3^k + 2^k is prime for some natural number k.
-
A240802: Smallest possible value of maximal overlap in any layout for the 2^n-node shuffle-exchange graph.
-
A240828: a(1)=a(2)=0, a(3)=2; thereafter a(n) = Sum( a(n-i-s-a(n-i-1)), i=0..k-1 ), where s=0, k=3.
-
A240836: Numbers n such that n^3 = x*y*z where 2 <= x <= y <= z , n^3+1 = (x-1)*(y+1)*(z+1).
-
A240846: a(0)=0, a(1)=1, a(n) = a(n-1)*12 + 13.
-
A240883: Central terms of the triangle in A240857.
-
A240917: a(n) = 2*3^(2*n) - 3*3^n + 1.
-
A240926: a(n) = 2 + L(2*n) = 2 + A005248(n), n >= 0, with the Lucas numbers (A000032).
-
A240930: a(n) = n^7 - n^6.
-
A240931: a(n) = n^8 - n^7.
-
A240932: a(n) = n^9 - n^8.
-
A240933: a(n) = n^10 - n^9.
-
A240951: Maximum number of dividing subsets of a set of n natural numbers.
-
A240963: Numbers n such that the decimal expansion of n^n contains no zeros.
-
A240993: A000142 (n+1) * A002109(n), a product of factorials and hyperfactorials.