Summary of block A182
Sequences in block A182
Section titled “Sequences in block A182”-
A182079: a(n) = floor(n*floor((n-1)/2)/3).
-
A182080: a(n) is the maximal depth of an indecomposable exact cover of an n-set.
-
A182104: Duplicate of A073587.
-
A182136: Diameter of rotation graph G_n.
-
A182143: Number of independent vertex sets in the Moebius ladder graph with 2n nodes (n >= 0).
-
A182148: a(n) = Fibonacci(n-1)^n.
-
A182149: a(n) = Fibonacci(n^3).
-
A182166: The total number of components of size 2 over all simple labeled graphs on n nodes.
-
A182188: A sequence of row differences for table A182119.
-
A182189: a(n) = 6*a(n-1) - a(n-2) - 4 with n > 1, a(0)=1, a(1)=3.
-
A182190: a(n) = 6*a(n-1) - a(n-2) + 4 with n > 1, a(0)=0, a(1)=4.
-
A182191: a(n) = 6*a(n-1) - a(n-2) + 12 with n>1, a(0)=-1, a(1)=5.
-
A182193: Sequence of row differences related to table A182355.
-
A182212: a(n) = floor(n! / Fibonacci(n)).
-
A182213: a(n) = n! mod Fibonacci(n).
-
A182214: Bondage number of the Cartesian product graph G = C_n X K_2.
-
A182215: Bondage number of the Cartesian product graph G = C_n X C_3.
-
A182220: Largest number k such that there exists an extensional acyclic digraph on n labeled nodes with k sources.
-
A182228: a(n) = 3*a(n-2) - a(n-1) for n > 1, a(0) = 0, a(1) = 1.
-
A182229: a(n) = a(n-1) + floor(a(n-2)/3) with a(0)=2, a(1)=3.
-
A182230: a(n) = a(n-1)+floor(a(n-2)/4) with a(0)=3, a(1)=4.
-
A182260: Number of ordered triples (w,x,y) with all terms in {1,…,n} and 2w<x+y.
-
A182280: a(n) = floor(a(n-1)/4)+a(n-2) with a(0)=3, a(1)=4.
-
A182281: a(n) = floor(a(n-1)/3)+a(n-2) with a(0)=2, a(1)=3.
-
A182305: a(n+1) = a(n) + floor(a(n)/4) with a(0)=4.
-
A182306: a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.
-
A182307: a(n+1) = a(n) + floor(a(n)/6) with a(0) = 6.
-
A182308: a(n+1) = a(n) + floor(a(n)/7) with a(0) = 7.
-
A182323: a(n) = (194*n + 3*(-1)^n + 1)/4 + 24.
-
A182331: Primes of the form 6^k + 1.
-
A182361: a(n+1) = a(n) + floor(a(n)/8) with a(0)=8.
-
A182362: a(n+1) = a(n) + floor(a(n)/9) with a(0)=9.
-
A182363: a(n+1) = a(n) + floor(a(n)/10) with a(0) = 10.
-
A182386: a(0) = 1, a(n) = 1 - n * a(n-1).
-
A182415: a(0) = 1, a(1) = 2; for n>1, a(n) = a(n-1) + a(n-2) + 4.
-
A182428: a(n) = 2n(19-n).
-
A182432: Recurrence a(n)*a(n-2) = a(n-1)*(a(n-1) + 3) with a(0) = 1, a(1) = 4.
-
A182435: a(n) = 6*a(n-1) - a(n-2) - 2 with n>1, a(0)=0, a(1)=1.
-
A182453: a(n) = 3^n - n*(n-1)/2.
-
A182455: a(0)=1, a(n) = (a(n-1) mod (n+2))*(n+2).
-
A182460: a(n) = (3/5)*2^(4n+1) - (1/5).
-
A182461: a(n) = 3*a(n-1) - 2*a(n-2) with a(0)=16 and a(1)=40.
-
A182462: a(n) = 3a(n-1) - 2a(n-2) with a(0)=20 and a(1)=50.
-
A182464: a(n) = 3a(n-1) - 2a(n-2) with a(0)=24 and a(1)=60.
-
A182465: a(n) = 3a(n-1) - 2a(n-2) with a(0)=28 and a(1)=70.
-
A182466: a(n) = 3a(n-1) - 2a(n-2) with a(0)=32 and a(1)=80.
-
A182467: a(n) = 3a(n-1) - 2a(n-2) with a(0)=36 and a(1)=90.
-
A182480: Decimal expansion of 16000000/63.
-
A182512: a(n) = (16^n - 1)/5.
-
A182522: a(0) = 1; thereafter a(2*n + 1) = 3^n, a(2*n + 2) = 2 * 3^n.
-
A182531: Extremal graph numbers for a triangle with an edge off it.
-
A182568: a(n) = 2*floor(n/4)*(n - 2*(1 + floor(n/4))).
-
A182614: Least k such that floor(k/r^n)=n, where r = golden ratio = (1+sqrt(5))/2.
-
A182664: a(n) = A088828(n) + A157502(n).
-
A182687: a(n) = the smallest 1-digit number with exactly n divisors, a(n) = 0 if no such number exists.
-
A182741: A shell model of partitions as a binary code.
-
A182751: a(1)=1, a(2)=3, a(3)=6; a(n) = 3*a(n-2) for n > 3.
-
A182752: a(1) = 1, a(2) = 6, for n >= 3; a(n) = the smallest number greater than a(n-1) such that [[a(n-2) + a(n-1)] * [a(n-2) + a(n)] * [a(n-1) + a(n)]] / [a(n-2) * a(n-1) * a(n)] is an integer.
-
A182765: Beatty sequence for (6 + sqrt(2))/4.
-
A182767: Beatty sequence for 1+e^2.
-
A182768: Beatty sequence for 1+e^(-2).
-
A182769: Beatty sequence for (4 + sqrt(2))/2.
-
A182771: Beatty sequence for (6+sqrt(3))/3.
-
A182778: Beatty sequence for 3 + sqrt(3).
-
A182780: Twice A024537.
-
A182788: Number of n-colorings of the 3 X 3 X 3 triangular grid.
-
A182815: The third row of table A182630.
-
A182834: Complement of A007590, except for initial zeros.
-
A182835: n+floor(sqrt(2n+3)), complement of A179207.
-
A182866: Number of edges in the n^2 X n^2 Sudoku graph.
-
A182868: a(n) = -1 + n + 4*n^2.
-
A182890: Number of (1,0)-steps of weight 1 at level 0 in all weighted lattice paths in L_n.
-
A182895: Number of (1,0)-steps at level 0 in all weighted lattice paths in L_n.
-
A182981: Number of grid point that are covered at the n-th stage of the cellular automata which is a version “forest” of the shell model of partitions, with a(0)=1. The outers shells are represented as trees.