Summary of block A226
Sequences in block A226
Section titled “Sequences in block A226”-
A226033: Round(n * exp(-1 - 1/(2n))), an approximation to the number of daughters to wait before picking in the sultan’s dowry problem (Better that A225593).
-
A226107: Number of strict partitions of n with Cookie Monster number 2.
-
A226142: The smallest positive integer k such that the symmetric group S_n is a product of k cyclic groups.
-
A226164: Sequence used for the quadratic irrational number belonging to the principal indefinite binary quadratic form.
-
A226198: a(n) = floor((n-1)!/n).
-
A226199: a(n) = 7^n + n.
-
A226200: a(n) = 6^n + n.
-
A226201: a(n) = 8^n + n.
-
A226202: a(n) = 9^n + n.
-
A226205: a(n) = F(n)^2 - F(n-1)^2 or F(n+1) * F(n-2) where F(n) = A000045(n), the Fibonacci numbers.
-
A226233: Ten copies of each positive integer.
-
A226238: a(n) = (n^n - n)/(n - 1).
-
A226264: Number of additive Z_2 Z_8 codes of a certain type (see Siap-Aydogdu for precise definition).
-
A226265: Number of additive Z_2 Z_8 codes of a certain type (see Siap-Aydogdu for precise definition).
-
A226271: Index of 1/n in the Fibonacci (or rabbit) ordering of the positive rationals.
-
A226276: Period 4: repeat [8, 4, 4, 4].
-
A226279: a(4n) = a(4n+2) = 2*n , a(4n+1) = a(4n+3) = 2*n-1.
-
A226292: (10*n^2+4*n+(1-(-1)^n))/8.
-
A226294: Period 2: repeat [6, 4].
-
A226308: a(n) = a(n-1) + a(n-2) + 2*a(n-3) with a(0)=2, a(1)=1, a(2)=5.
-
A226433: The number of permutations of length n in a particular geometric grid class.
-
A226447: Expansion of (1-x+x^3)/(1-x^2+2*x^3-x^4).
-
A226449: a(n) = n*(5*n^2-8*n+5)/2.
-
A226450: a(n) = n*(3*n^2 - 5*n + 3).
-
A226488: a(n) = n*(13*n - 9)/2.
-
A226489: a(n) = n*(15*n-11)/2.
-
A226490: a(n) = n*(19*n-15)/2.
-
A226491: a(n) = n*(21*n-17)/2.
-
A226492: a(n) = n*(11*n-5)/2.
-
A226493: Closed walks of length n in K_4 graph.
-
A226499: Triangular numbers representable as m * triangular(m).
-
A226500: Triangular numbers representable as 3 * x^2.
-
A226508: a(n) = Sum_{i=3^n..3^(n+1)-1} i.
-
A226511: a(n) = 3*(5^n-3^n)/2.
-
A226514: Column 3 of array in A226513.
-
A226538: a(2t) = a(2t-1) + 1, a(2t+1) = a(2t) + a(2t-2) for t >= 1, with a(0) = a(1) = 1.
-
A226570: a(n) = Sum_{k=1..n} (k+1)! mod n.
-
A226576: Smallest number of integer-sided squares needed to tile a 3 X n rectangle.
-
A226577: Smallest number of integer-sided squares needed to tile a 4 X n rectangle.
-
A226588: a(n) = c({1}^n), the Cantor tuple function c applied to an n-tuple of 1’s.
-
A226596: Lengths of maximal non-crossing and non-overlapping increasing paths in n X n grids.
-
A226638: Product of Pell and Lucas numbers.
-
A226695: Pell equation solutions (32*b(n))^2 - 41*(5*a(n))^2 = -1 with b(n) := A226694(n), n>=0.
-
A226702: Positive solutions y/5 of the Pell equation x^2 - 61*y^2 = -4.
-
A226725: Denominator of the median of {1, 1/2, 1/3, …, 1/n}.
-
A226730: a(n) = n! + (2*n-1)!/(n-1)!.
-
A226737: a(n) = 11^n + n.
-
A226782: If n == 0 (mod 2) then a(n) = 0, otherwise a(n) = 4^(-1) in Z/nZ*.
-
A226786: If n=0 (mod 2) then a(n)=0, otherwise a(n)=8^(-1) in Z/nZ*.
-
A226803: Primes p where the digital sum of p^2 is equal to 7.
-
A226960: Numbers n such that 1^n + 2^n + 3^n +…+ n^n == 2 (mod n).
-
A226962: Numbers n such that 1^n + 2^n + 3^n + … + n^n == 4 (mod n).
-
A226966: Numbers n such that 1^n + 2^n + 3^n + … + n^n == 8 (mod n).
-
A226998: The number of descents over all functions f:{1,2,…,n}->{1,2,…,n}.