Summary of block A191
Sequences in block A191
Section titled “Sequences in block A191”-
A191006: Number of n X n symmetric binary matrices with each 1 adjacent to exactly 1 diagonally neighboring 1.
-
A191007: a(n) = n*2^(n+1) + (2^(n+3)+(-1)^n)/3.
-
A191008: a(n) = (n*3^(n+1)+((5*3^(n+1)+(-1)^(n))/4))/4.
-
A191010: a(n) = (n*4^(n+1) + (6*4^(n+1)+(-1)^n)/5)/5.
-
A191012: a(n) = n^5 - n^4 + n^3 - n^2 + n.
-
A191014: a(n) = 10*a(n-1) + 2*a(n-2), with a(0)=0, a(1)=1.
-
A191152: [4n*e]-2[2n*e], where [ ]=floor.
-
A191156: a(n) = [6*n*Pi] - 2*[3*n*Pi], where [ ]=floor.
-
A191162: a(n) = [4*n*Pi] - 2*[2*n*Pi], where [ ]=floor.
-
A191188: a(n) = floor(8*n*Pi) - 2*floor(4*n*Pi).
-
A191272: Expansion of x*(4+5*x)/( (1-4*x)*(1 + x + x^2) ).
-
A191276: Numbers that are congruent to {0, 1, 4, 5, 7, 9, 11} mod 12.
-
A191331: Positions of 2 in A191329.
-
A191341: a(n) = 4^n - 2*2^n + 3.
-
A191355: Indices of terms in A069748 with two decimal digits 1 and all others 0.
-
A191363: Numbers m such that sigma(m) = 2*m - 2.
-
A191370: a(n) = 2*(1+(-1)^n)/3 + 2*A010892(n-1).
-
A191413: a(n) = 3*n^2 - 2*n + 7.
-
A191465: a(n) = 9^n - 2^n.
-
A191466: a(n) = 9^n - 5^n.
-
A191467: a(n) = 9^n - 7^n.
-
A191468: a(n) = 8^n - 5^n.
-
A191484: Number of compositions of even natural numbers into 5 parts <= n.
-
A191489: Number of compositions of even natural numbers into 6 parts <= n.
-
A191494: Number of compositions of even natural numbers in 7 parts <= n.
-
A191495: Number of compositions of even natural numbers into 8 parts <= n.
-
A191496: Number of compositions of even numbers into 9 parts <= n.
-
A191497: a(n+1) = 2*a(n) + A014017(n+5), a(0) = 0.
-
A191535: The least integer N for which there exists an n-universal tournament on N vertices.
-
A191558: a(n) = 0 if n prime, otherwise n.
-
A191559: a(n) = 25^(4*n+1).
-
A191560: a(n) = 25^(4*n+3).
-
A191561: a(n) = 2^n mod 3*n.
-
A191562: a(n) = 7^n mod 3*n.
-
A191593: Number of partitions of 12*n into parts < 5.
-
A191610: Possible number of trailing zeros in k!.
-
A191627: a(n) = floor(3^n/(3n-1)).
-
A191628: a(n) = floor((3^n)/(3*n - 2)).
-
A191629: a(n) = floor((2^n)/(3*n - 1)).
-
A191630: a(n) = floor((-1 + 2^n)/(1 + 2*n)).
-
A191631: a(n) = floor((2^n)/(2n-1)).
-
A191632: a(n) = floor((3^n)/(2*n - 1)).
-
A191633: a(n) = floor((1 + 2^n)/(1 + 2*n)).
-
A191634: a(n) = floor((1 + 3^n)/(1 + 3*n)).
-
A191636: a(n) = floor((-1 + 4^n)/(-1 + 2*n)).
-
A191637: a(n) = floor((1 + 4^n)/(1 + 2*n)).
-
A191638: a(n) = floor((-1 + 4^n)/(-1 + 3*n)).
-
A191639: a(n) = floor((1 + 4^n)/(1 + 3*n)).
-
A191640: a(n) = floor((-1 + 4^n)/(-1 + 4*n)).
-
A191641: a(n) = floor((1 + 4^n)/(1 + 4*n)).
-
A191662: a(n) = n! / A000034(n-1).
-
A191680: Number of compositions of odd natural numbers into 9 parts <= n.
-
A191681: a(n) = (9^n - 1)/2.
-
A191682: Twice A113473.
-
A191690: a(n) = n^n-n^(n-1)-n^(n-2)-…-n^2-n-1.
-
A191694: a(n) = floor((3^n - 2^n)/n).
-
A191745: a(n) = 12*n^3 + 9*n^2 + 2*n.
-
A191759: Least significant decimal digit of (2n-1)^2.
-
A191760: Digital root of the n-th odd square.
-
A191761: Last digit of (2*n)^2. Also period 5: repeat [0, 4, 6, 6, 4].
-
A191797: a(n) = binomial(F(n), 2) where F(n) = A000045(n).
-
A191821: a(n) = n*(2^n - n + 1) + 2^(n-1)*(n^2 - 3*n + 2).
-
A191871: a(n) = numerator(n^2 / 2^n).
-
A191899: Number of compositions of odd natural numbers into 8 parts <=n.
-
A191900: Number of compositions of odd natural numbers into 7 parts <=n.
-
A191901: Number of compositions of odd natural numbers into 6 parts <= n.
-
A191902: Number of compositions of odd positive integers into 5 parts <= n.
-
A191903: Number of compositions of odd natural numbers into 4 parts <= n.
-
A191938: Number of simple full arrangements of pseudolines of order n.
-
A191942: Number of one-marked arrangements of pseudolines of order n.
-
A191967: n * (numbers that are not divisible by 3).
-
A191968: a(n) = Fibonacci(8n+5) mod Fibonacci(8n+1).
-
A191993: a(n) = 3^(n-1) + C(2*n, n)/2.