Summary of block A151
Sequences in block A151
Section titled “Sequences in block A151”-
A151332: Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of 4 n steps taken from {(-1, -1), (-1, 1), (1, 0)}.
-
A151334: Duplicate of A005789.
-
A151342: Duplicate of A001246.
-
A151374: Number of walks within N^2 (the first quadrant of Z^2) starting at (0, 0), ending on the vertical axis and consisting of 2n steps taken from {(-1, -1), (-1, 0), (1, 1)}.
-
A151383: Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, -1), (-1, 0), (-1, 1), (1, 1)}.
-
A151392: Duplicate of A000888.
-
A151403: Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2*n steps taken from {(-1, 0), (-1, 1), (1, 0), (1, 1)}.
-
A151542: Generalized pentagonal numbers: a(n) = 12*n + 3*n*(n-1)/2.
-
A151575: G.f.: (1+x)/(1+x-2*x^2).
-
A151611: a(1) = 4; for n >= 1, a(n+1) = 4 + binomial(a(n), 2).
-
A151675: Row sums of A154685.
-
A151746: G.f.: (1-2*x-5*x^2+4*x^3)/((1-4*x)*(1-x)^2).
-
A151750: Numbers n such that gcd( binomial(2n,n), 3*5*7*11 ) = 1.
-
A151754: Number of n-digit numbers that are divisible by 5^n.
-
A151763: If n is a prime == 1 mod 4 then a(n) = 1, if n is a prime == 3 mod 4 then a(n) = -1, otherwise a(n) = 0.
-
A151774: Characteristic function of numbers with binary weight 2 (A018900).
-
A151794: a(1)=2, a(2)=4, a(3)=6; a(n+3) = a(n+2)+ 2*a(n), n>=1.
-
A151798: a(0)=1, a(1)=2, a(n)=4 for n>=2.
-
A151817: a(n) = 2*(2*n)!/n!.
-
A151819: First component x of pairs (x,y) where x!+y! is a square, sorted on x.
-
A151821: Powers of 2, omitting 2 itself.
-
A151842: a(3n) = n, a(3n+1) = 2n+1, a(3n+2) = n+1.
-
A151875: First differences are also Levenshtein distances between the integers written in English, including hyphenation.
-
A151889: a(1)=2, a(2)=3; a(2k-1)=2a(2k-2)+a(2k-3), a(2k)=3a(2k-2)+2a(2k-3), k >= 2.
-
A151899: Period 6: repeat [0, 0, 1, 1, 1, 2].
-
A151902: a(n) = wt(k) + f(j) if n = 6k+j, 0 <= j < 6, where wt() = A000120(), f() = A151899().
-
A151908: Number of nonisomorphic cube tilings of dimension n which can be constructed using the recipe presented at the beginning of Section 3 of the Lagarias-Shor paper.
-
A151915: Wythoff AAAA numbers.
-
A151961: Semiperimeter of the n-th Heronian triangle.
-
A151972: Numbers that are congruent to {0, 1, 6, 10} mod 15.
-
A151974: a(n) = n*(n+1)*(n+2)*(n+3)*(n+4)/8.
-
A151978: Numbers that are congruent to {0, 1} mod 17.
-
A151979: Numbers congruent to {0, 1} (mod 19).
-
A151983: Numbers congruent to {0, 1} mod 32.
-
A151984: Numbers that are congruent to {0, 1} mod 64.
-
A151988: G.f.: (x*(x^4+1)*(x^2-x+1)*(x^2+x+1))/((x^4+x^3+x^2+x+1)*(x^4-x^3+x^2-x+1)*(x-1)^2).
-
A151989: a(n) = A001512(n)/24 = (5*n+1)*(5*n+2)*(5*n+3)*(5*n+4)/24.
-
A151997: a(n) = (n 1’s followed by a 3)^2.