Summary of block A227
Sequences in block A227
Section titled “Sequences in block A227”-
A227012: a(n) = floor(M(g(n-1)+1, …, g(n))), where M = harmonic mean and g(n) = n^3.
-
A227017: Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(3n-1)/2 = A000326(n).
-
A227047: Expansion of x^2*(1+x^2) / ( (x^2-x+1)*(-x^2-x+1)*(1+x+x^2) ).
-
A227052: a(n) = (n^2)! / (n^2-n)! = number of ways of placing n labeled balls into n^2 labeled boxes with at most one ball in each box.
-
A227104: a(0)=-1, a(1)=3; a(n+2) = a(n+1) + a(n) + 2*A057078(n+1).
-
A227121: Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of zero, with rows and columns of the latter in lexicographically nondecreasing order.
-
A227139: Chebyshev S-polynomial evaluated at x = 48.
-
A227140: a(n) = n/gcd(n,2^5), n >= 0.
-
A227200: a(n) = a(n-1) + a(n-2) - 2^(n-1) with a(0)=a(2)=0, a(1)=-a(3)=1, a(4)=-5.
-
A227209: Expansion of 1/((1-x)^2*(1-2*x)*(1-4*x)).
-
A227230: Numbers k such that 3*2^k + {5,7} are twin primes.
-
A227265: Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.
-
A227316: a(n) = n(n+1) if n == 0 or 1 (mod 4), otherwise a(n) = n(n+1)/2.
-
A227353: Number of lattice points in the closed region bounded by the graphs of y = 3*x/5, x = n, and y = 0, excluding points on the x-axis.
-
A227361: If n is even, then a(n) = n + bitsum(n), else a(n) = n - bitsum(n), where bitsum(n) is the count of binary 1’s in n, A000120.
-
A227380: Doubling the first two of every four nonnegative numbers.
-
A227394: The maximum value of x^4(n-x)(x-1) for x in 1..n is reached for x = a(n).
-
A227404: Total number of inversions in all permutations of order n consisting of a single cycle.
-
A227541: a(n) = floor(13*n^2/4).
-
A227546: a(n) = n! + n^2 + 1.
-
A227582: Expansion of (2+3*x+2*x^2+2*x^3+3*x^4+x^5-x^6)/(1-2*x+x^2-x^5+2*x^6-x^7).
-
A227589: Maximum label within a minimal labeling of n identical 4-sided dice yielding the most possible sums.
-
A227665: Number of lattice paths from {n}^3 to {0}^3 using steps that decrement one component by 1 such that for each point (p_1,p_2,p_3) we have abs(p_{i}-p_{i+1}) <= 1.
-
A227703: The Wiener index of the zig-zag polyhex nanotube TUHC_6[2n,2] defined pictorially in Fig. 1 of the Eliasi et al. reference.
-
A227707: The terminal Wiener index of the dendrimer D_n defined pictorially in Fig. 1 of the Heydari et al. reference.
-
A227712: a(n) = 9*2^n - 3*n - 5.
-
A227719: Floor(1/s(n)), where s(n) = n*log(1+1/n) - (2n-1)/(2n).
-
A227720: Round(1/s(n)), where s(n) = n*log(1+1/n) - (2n-1)/(2n).
-
A227721: Floor(1/s(n)), where s(n) = (2n+1)/(2n+2) - n*log((n+1)/n).
-
A227786: Take squares larger than 1, subtract 3 from even squares and 2 from odd squares; a(n) = a(n-1) + A168276(n+1) (with a(1) = 1).
-
A227805: Sum of even numbers starting at 2, alternating signs.
-
A227832: Sum of odd numbers starting with 1, alternating signs (beginning with plus).
-
A227849: a(n) = 2 * floor( 3/14 * n^2) if n even, a(n) = 2 * round( 3/14 * n^2) -1 if n odd.
-
A227863: Numbers congruent to {1,49} mod 120.
-
A227875: Fibonacci numbers which are perfect powers.
-
A227906: Coins left after packing heart patterns (fixed orientation) into n X n coins.
-
A227970: Triangular arithmetic on half-squares: b(n)*(b(n) - 1)/2 where b(n) = floor(n^2/2).
-
A227978: a(0)=1, a(1)=2; for n>1, a(n) = n*(2^n+4)/4.