Summary of block A036
Sequences in block A036
Section titled “Sequences in block A036”-
A036068: Expansion of (-1+1/(1-3*x)^3)/(9*x).
-
A036070: Expansion of (-1+1/(1-4*x)^4)/(16*x); related to A038846.
-
A036071: Expansion of 1/(1-5*x)^5.
-
A036084: Expansion of 1/(1-6*x)^6.
-
A036117: a(n) = 2^n mod 11.
-
A036118: a(n) = 2^n mod 13.
-
A036119: a(n) = 3^n mod 17.
-
A036120: a(n) = 2^n mod 19.
-
A036121: 5^n mod 23.
-
A036122: a(n) = 2^n mod 29.
-
A036123: a(n) = 3^n mod 31.
-
A036124: a(n) = 2^n mod 37.
-
A036125: a(n) = 6^n mod 41.
-
A036126: a(n) = 3^n mod 43.
-
A036127: a(n) = 5^n mod 47.
-
A036128: a(n) = 2^n mod 53.
-
A036129: a(n) = 2^n mod 59.
-
A036130: a(n) = 2^n mod 61.
-
A036131: a(n) = 2^n mod 67.
-
A036132: a(n) = 7^n mod 71.
-
A036133: a(n) = 5^n mod 73.
-
A036134: a(n) = 3^n mod 79.
-
A036135: a(n) = 2^n mod 83.
-
A036136: a(n) = 3^n mod 89.
-
A036137: a(n) = 5^n mod 97.
-
A036138: a(n) = 2^n mod 101.
-
A036139: a(n) = 5^n mod 103.
-
A036140: a(n) = 2^n mod 107.
-
A036141: a(n) = 6^n mod 109.
-
A036142: 3^n mod 113.
-
A036143: a(n) = 3^n mod 127.
-
A036144: a(n) = 2^n mod 131.
-
A036145: 3^n mod 137.
-
A036146: a(n) = 2^n mod 139.
-
A036147: a(n) = 2^n mod 149.
-
A036148: 6^n mod 151.
-
A036149: 5^n mod 157.
-
A036150: a(n) = 2^n mod 163.
-
A036151: 5^n mod 167.
-
A036152: a(n) = 2^n mod 173.
-
A036153: a(n) = 2^n mod 179.
-
A036154: a(n) = 2^n mod 181.
-
A036156: 5^n mod 193.
-
A036157: a(n) = 2^n mod 197.
-
A036158: 3^n mod 199.
-
A036159: a(n) = 2^n mod 211.
-
A036160: a(n) = 3^n mod 223.
-
A036161: a(n) = 2^n mod 227.
-
A036162: a(n) = 6^n mod 229.
-
A036213: Duplicating binary multipliers; i.e., n+1 1-bits placed 2n bits from each other.
-
A036216: Expansion of 1/(1 - 3*x)^4; 4-fold convolution of A000244 (powers of 3).
-
A036217: Expansion of 1/(1-3*x)^5; 5-fold convolution of A000244 (powers of 3).
-
A036218: Hours recorded by a 24-hour clock.
-
A036219: Expansion of 1/(1-3*x)^6; 6-fold convolution of A000244 (powers of 3).
-
A036220: Expansion of 1/(1-3*x)^7; 7-fold convolution of A000244 (powers of 3).
-
A036221: Expansion of 1/(1-3*x)^8; 8-fold convolution of A000244 (powers of 3).
-
A036222: Expansion of 1/(1-3*x)^9; 9-fold convolution of A000244 (powers of 3).
-
A036223: Expansion of 1/(1-3*x)^10; 10-fold convolution of A000244 (powers of 3).
-
A036235: Found on a quiz long ago.
-
A036239: Number of 2-element intersecting families of an n-element set; number of 2-way interactions when 2 subsets of power set on {1..n} are chosen at random.
-
A036242: Numerator of fraction equal to the continued fraction [0,2,4,…2n].
-
A036287: a(n) = ((2^(3*(2^n))) - 1).
-
A036289: a(n) = n*2^n.
-
A036290: a(n) = n*3^n.
-
A036291: a(n) = n*5^n.
-
A036292: a(n) = n*6^n.
-
A036293: a(n) = n*7^n.
-
A036294: a(n) = n*8^n.
-
A036298: (n!)!, n>0 (note that A000197 is the correct version of this sequence, with a(0) = 1, not 0).
-
A036404: a(n) = ceiling(n^2/5).
-
A036405: a(n) = ceiling(n^2/7).
-
A036406: a(n) = ceiling(n^2/8).
-
A036407: a(n) = ceiling(n^2/9).
-
A036408: a(n) = ceiling(n^2/10).
-
A036409: a(n) = ceiling(n^2/11).
-
A036410: G.f.: (1+x^6)/((1-x)*(1-x^3)*(1-x^4)).
-
A036428: Square octagonal numbers.
-
A036442: a(n) = 2^((n-1)*(n+2)/2).
-
A036443: Number of ternary rooted trees with n nodes and height exactly 3.
-
A036453: a(n) = d(d(d(d(d(n))))), the 5th iterate of the number-of-divisors function d = A000005, with initial value n.
-
A036464: Number of ways to place two nonattacking queens on an n X n board.
-
A036486: a(n) = ceiling((n^3)/2).
-
A036487: a(n) = floor((n^3)/2).
-
A036498: Numbers of the form m*(6*m-1) and m*(6*m+1), where m is an integer.
-
A036499: Numbers of the form k*(k+1)/6 for k = 2 or 3 modulo 6.
-
A036542: a(n) = T(n, n), array T given by A047858.
-
A036543: a(n) = T(3,n), array T given by A048471.
-
A036544: a(n) = (2*(1 + n + (((10^n-1)/9) - n)/9)).
-
A036545: a(n) = T(4,n), array T given by A048471.
-
A036546: a(n) = T(5,n), array T given by A048471.
-
A036547: a(n) = T(6,n), array T given by A048471.
-
A036548: a(n) = T(7,n), array T given by A048471.
-
A036549: a(n) = T(8,n), array T given by A048471.
-
A036550: a(n) = T(0,n) + T(1,n-1) + … + T(n,0), array T given by A048471.
-
A036551: a(n) = 2^(n-1)*(3^n-1) + 1.
-
A036555: Hamming weight of 3n: number of 1’s in binary expansion of 3n.
-
A036557: Number of multiples of 3 in 0..2^n-1 with an even sum of base-2 digits.
-
A036563: a(n) = 2^n - 3.
-
A036572: Number of tetrahedra in largest triangulation of polygonal prism with regular polygonal base.
-
A036573: Size of maximal triangulation of an n-antiprism with regular polygonal base.
-
A036605: a(n) = a(n-2) + 2*a(n-3) + a(n-4).
-
A036659: Product of n with sum of next n consecutive integers.
-
A036666: Numbers k such that 5*k + 1 is a square.
-
A036679: a(n) = n^n - n!.
-
A036739: a(n) = (n!)^n+1.
-
A036740: a(n) = (n!)^n.
-
A036741: Values increase, Roman numerals increase lexicographically.
-
A036750: Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 7.
-
A036752: Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 8.
-
A036770: Number of labeled rooted trees with a degree constraint: (2*n)!/(2^n) * C(2*n+1, n).
-
A036781: a(n) = n + Sum_{k=0..n} k!.
-
A036782: a(n) = n - 1 + Sum_{j=0..n} j!.
-
A036799: a(n) = 2 + 2^(n+1)*(n-1).
-
A036800: a(n) = -6 + 2^(n+1)*(3 - 2*n + n^2).
-
A036826: a(n) = A036800(n)/2.
-
A036827: a(n) = 26 + 2^(n+1)*(-13 +9*n -3*n^2 +n^3).
-
A036828: A036827/2.
-
A036918: a(n) = floor(e*(n-1)*(n-1)!).
-
A036919: A036918/2.
-
A036999: Restricted permutations.