Summary of block A180
Sequences in block A180
Section titled “Sequences in block A180”-
A180004: a(n) is the nearest integer to n*(27/26).
-
A180027: Partial sums of A100706.
-
A180028: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + 3*x)/(1 - 6*x - 3*x^2).
-
A180029: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + 2*x)/(1 - 6*x - 2*x^2).
-
A180030: Number of n-move paths on a 3 X 3 chessboard of a queen starting or ending in a corner or side square.
-
A180031: Number of n-move paths on a 3 X 3 chessboard of a queen starting or ending in the central square.
-
A180032: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(1-5*x-7*x^2).
-
A180033: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 + x)/(1 - 5*x - 5*x^2).
-
A180034: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 - 2*x)/(1 - 6*x + 2*x^2).
-
A180035: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(1-5*x-3*x^2).
-
A180036: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 - 2*x)/(1 - 5*x - 3*x^2).
-
A180037: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(1-5*x-2*x^2).
-
A180038: Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1 - 3*x)/(1 - 5*x - 2*x^2).
-
A180053: a(1)=1, a(2)=101, a(n) = 1001*a(n-1) for n > 2.
-
A180064: a(n) = n!/A056040(n).
-
A180102: a(1)=1; a(n)=percentage of sum of previous terms represented by n.
-
A180103: Floor( 100*(n-1)/n ).
-
A180104: Floor( 100*n/(n-1) ).
-
A180118: a(n) = Sum_{k=1..n} (k+2)!/k! = Sum_{k=1..n} (k+2)*(k+1).
-
A180119: a(n) = (n+2)! * Sum_{k = 1..n} 1/((k+1)*(k+2)).
-
A180122: First of three “least, sum, least” self-generating sequences.
-
A180123: Second of three “least, sum, least” self-generating sequences.
-
A180140: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1+x+x^2)/(1-3*x-5*x^2).
-
A180141: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x - 2*x^2)/(1 - 3*x - 6*x^2).
-
A180142: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x - x^2)/(1 - 3*x - 3*x^2).
-
A180143: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x^2)/(1 - 4*x + x^2 + 2*x^3).
-
A180144: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 - 2*x^2)/(1 - 4*x + x^2 + 2*x^3).
-
A180145: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 - 3*x^2)/(1 - 4*x - 3*x^2 + 6*x^3).
-
A180146: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: 1/(1 - 4*x - 3*x^2 + 6*x^3).
-
A180147: Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + 3*x)/(1 - 4*x - 3*x^2 + 6*x^3).
-
A180148: a(n) = 3*a(n-1) + a(n-2) with a(0)=2 and a(1)=5.
-
A180167: a(0) = 1, a(1) = 7; a(n)= 6*a(n-1) + 6*a(n-2) for n>1.
-
A180168: a(n) = 2*a(n-1) + 5*a(n-2), a(0) = 1, a(1) = 3.
-
A180189: Number of permutations of [n] having exactly 1 circular succession. A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.
-
A180222: a(n) = 4*a(n-1) + 8*a(n-2), with a(1)=0 and a(2)=1.
-
A180223: a(n) = (11*n^2 - 7*n)/2.
-
A180226: a(n) = 4*a(n-1) + 10*a(n-2), with a(1)=0 and a(2)=1.
-
A180232: a(n) = n*(17*n - 13)/2.
-
A180250: a(n) = 5*a(n-1) + 10*a(n-2), with a(1)=0 and a(2)=1.
-
A180255: a(n) = n^2 * a(n-1) + n, a(0)=0.
-
A180291: Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-1.
-
A180319: Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.
-
A180324: Vassiliev invariant of fourth order for the torus knots.
-
A180354: a(n) = n^4 + 4*n.
-
A180355: a(n) = n^5 + 5n.
-
A180356: a(n) = n^6 + 6n.
-
A180357: a(n) = n^7 + 7*n.
-
A180358: n^8+8n.
-
A180359: n^9+9n.
-
A180413: Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.
-
A180415: a(n) = (n^3 - 3n^2 + 14n - 6)/6.
-
A180435: a(n) = a(n-1)*2^n+n, a(0)=1.
-
A180445: All positive solutions, x, for each of two Diophantine equations noted by Richard K. Guy.
-
A180447: n appears 3n+1 times.
-
A180486: Numbers of the form ceiling(A179896(j)/A018252(j)) where A179896(j) mod A018252(j) <> 0.
-
A180516: Numbers of the form i*4^j-1 (i=1..3, j >= 0).
-
A180569: The Wiener index of the P_3 X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph.
-
A180577: The Wiener index of the windmill graph D(6,n). The windmill graph D(m,n) is the graph obtained by taking n copies of the complete graph K_m with a vertex in common (i.e., a bouquet of n pieces of K_m graphs).
-
A180578: The Wiener index of the Dutch windmill graph D(6,n) (n>=1).
-
A180579: The Wiener index of the Dutch windmill graph D(5,n) (n>=1).
-
A180589: a(n) = floor(n!*h(n)/n), where h(n) = Sum_{k=1..n} 1/k.
-
A180592: Digital root of 2n.
-
A180593: Digital root of 3n.
-
A180594: Digital root of 4n.
-
A180595: Digital root of 5n.
-
A180596: Digital root of 6n.
-
A180597: Digital root of 7n.
-
A180598: Digital root of 8n.
-
A180599: Zero followed by infinitely many 9’s.
-
A180602: a(n) = (2^(n+1) - 1)^n.
-
A180632: Minimum length of a string over the alphabet A = {1,2,…,n} that contains every permutation of A as a substring exactly once, also known as length of the minimal super-permutation.
-
A180664: Golden Triangle sums: a(n) = a(n-1) + A001654(n+1) with a(0)=0.
-
A180671: a(n) = Fibonacci(n+6) - Fibonacci(6).
-
A180672: a(n) = Fibonacci(n+7) - Fibonacci(7).
-
A180673: a(n) = Fibonacci(n+8) - Fibonacci(8).
-
A180674: a(n) = Fibonacci(n+9) - Fibonacci(9).
-
A180713: If n is even then a(n) = 3n, if n == 1 mod 4 then a(n) = 3n+1, if n == 3 mod 4 then a(n) = 3n+2.
-
A180739: Diagonal of array arising in computing the number of numerical semigroups using generating functions.
-
A180844: a(n) = (27^n - 2^n)/25.
-
A180853: Trajectory of 4 under map n->A006368(n).
-
A180857: Wiener index of the Moebius ladder M(n).
-
A180861: Wiener index of the n-pan graph.
-
A180863: Wiener index of the n-sun graph.
-
A180919: a(n) = n^2 + 731*n + 1.
-
A180928: 1 + product of any two terms is a triangular number.
-
A180964: a(0)=1; for n>0, a(n) = 1 + 3*A117571(n-1).
-
A180968: The only integers that cannot be partitioned into a sum of six positive squares.