Summary of block A265
Sequences in block A265
Section titled “Sequences in block A265”-
A265021: Sum of fifth powers of the first n even numbers.
-
A265032: Maximal size of an error-correcting code of length n and minimal distance 3 over an alphabet of size 4.
-
A265046: Coordination sequence for a 4.6.6 point in the 3-transitive tiling {4.6.6, 6.6.6, 6.6.6.6} of the plane by squares and dominoes (hexagons).
-
A265056: Partial sums of A234275.
-
A265078: Partial sums of A072154.
-
A265083: Column 3 of array in A265080.
-
A265098: Integers n such that A138523(n) is 1 or a prime.
-
A265185: Non-vanishing traces of the powers of the adjacency matrix for the simple Lie algebra B_4: 2 * ((2 + sqrt(2))^n + (2 - sqrt(2))^n).
-
A265187: Nonnegative m for which 2*floor(m^2/11) = floor(2*m^2/11).
-
A265188: Nonnegative m for which 3*floor(m^2/11) = floor(3*m^2/11).
-
A265225: Total number of ON (black) cells after n iterations of the “Rule 54” elementary cellular automaton starting with a single ON (black) cell.
-
A265228: Interleave the even numbers with the numbers that are congruent to {1, 3, 7} mod 8.
-
A265278: Expansion of (x^4+x^3-x^2+x)/(x^3+x^2-3*x+1).
-
A265284: Total number of ON (black) cells after n iterations of the “Rule 94” elementary cellular automaton starting with a single ON (black) cell.
-
A265286: Minimal number of pieces of a cake such that they can be distributed equally among k guests for any k=1,2,…,n.
-
A265333: Characteristic function for A265334: a(n) = 1 if n >= k! but < 2*k! for some k, 0 otherwise.
-
A265380: Binary representation of the middle column of the “Rule 158” elementary cellular automaton starting with a single ON (black) cell.
-
A265381: Decimal representation of the middle column of the “Rule 158” elementary cellular automaton starting with a single ON (black) cell.
-
A265382: Total number of ON (black) cells after n iterations of the “Rule 158” elementary cellular automaton starting with a single ON (black) cell.
-
A265428: Number of ON (black) cells in the n-th iteration of the “Rule 188” elementary cellular automaton starting with a single ON (black) cell.
-
A265429: Total number of ON (black) cells after n iterations of the “Rule 188” elementary cellular automaton starting with a single ON (black) cell.
-
A265430: Number of OFF (white) cells in the n-th iteration of the “Rule 188” elementary cellular automaton starting with a single ON (black) cell.
-
A265431: Total number of OFF (white) cells after n iterations of the “Rule 188” elementary cellular automaton starting with a single ON (black) cell.
-
A265611: a(n) = a(n-1) + floor((n-1)/2) - (-1)^n + 2 for n>=2, a(0)=1, a(1)=3.
-
A265645: a(n) = n^2 * floor(n/2).
-
A265667: Permutation of nonnegative integers: a(n) = n + floor(n/3)*(-1)^(n mod 3).
-
A265688: Binary representation of the n-th iteration of the “Rule 190” elementary cellular automaton starting with a single ON (black) cell.
-
A265722: Number of ON (black) cells in the n-th iteration of the “Rule 1” elementary cellular automaton starting with a single ON (black) cell.
-
A265723: Number of OFF (white) cells in the n-th iteration of the “Rule 1” elementary cellular automaton starting with a single ON (black) cell.
-
A265888: a(n) = n + floor(n/4)*(-1)^(n mod 4).
-
A265948: Numbers whose name in German contains the letter Ö (O with Umlaut).
-
A265987: Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.