Summary of block A259
Sequences in block A259
Section titled “Sequences in block A259”-
A259042: Period 8 sequence [0, 1, 1, 1, 2, 1, 1, 1, …].
-
A259044: Period 8 sequence [ 0, 1, 0, 1, 1, 1, 0, 1, …].
-
A259054: a(n) = 4*n^2 - 4*n + 19, n >= 1.
-
A259055: a(n) = 9*n^2 + 18*n + 7.
-
A259076: Powers of 80.
-
A259104: A000522(n+2)-A000522(n).
-
A259108: a(n) = 2 * A000538(n).
-
A259109: 2*A000540.
-
A259110: 2*A000447(n).
-
A259131: Numbers n such that 13*n^2 + 52 is a square.
-
A259215: Number of (n+1) X (1+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.
-
A259264: Cyclotomic polynomial value Phi(5,n!).
-
A259290: Number of (n+1) X (1+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0001 0101 or 0111.
-
A259319: a(n) = 2*A002309(n).
-
A259322: Sum of sixth powers of odd numbers.
-
A259348: a(n) = n^3 - 8.
-
A259361: n occurs 2n+2 times.
-
A259445: Multiplicative with a(n) = n if n is odd and a(2^s)=2.
-
A259451: a(n) = n^2*Fibonacci(n).
-
A259455: n Sum_n Sum_n Sum_n.
-
A259486: a(n) = 3*n^2 - 3*n + 1 + 6*floor((n-1)*(n-2)/6).
-
A259503: Numbers k such that k^2+1 is the product of a Fibonacci number and a Lucas number.
-
A259546: a(n) = n^3*Fibonacci(n).
-
A259547: a(n) = n^4*Fibonacci(n).
-
A259549: Triangle T(n,k) with rows of length 2n-1 filled with consecutive integers, each appearing twice except for the last term, T(n,2n-1) = n(n+1)/2.
-
A259555: a(n) = 2*n^2 - 2*n + 17.
-
A259557: a(n) = binomial(4*n-1, 2*n).
-
A259614: Numbers congruent to {17,29} mod 36.
-
A259661: Binary representation of the middle column of the “Rule 54” elementary cellular automaton starting with a single ON (black) cell.
-
A259705: Row sums of A259704.
-
A259706: a(n) = Sum_k k*A259707(n,k).
-
A259713: a(n) = 3*2^n - 2*(-1)^n.
-
A259748: a(n) = (Sum_{0<x<y<n} x*y) mod n.
-
A259750: Numbers that are congruent to {14, 22} mod 24.
-
A259751: Numbers that are congruent to {8, 16} mod 24.
-
A259752: a(n) = 24*n - 18.
-
A259754: Numbers that are congruent to {3,9,15,18,21} mod 24.
-
A259755: Numbers that are congruent to {4, 20} mod 24.
-
A259796: Number of partitions of 3^n into n-th powers.
-
A259821: a(n) = floor( (3^n+1)^2/3^n ).
-
A259925: a(n) = (n^2 - n - 1)^n.
-
A259926: a(n) = n^(2*n) - n^(2*n - 1).