Skip to content

Summary of block A302

39 sequences
  • A302097: Number of odd prime factors (with multiplicity) of generalized Fermat number 13^(2^n) + 1.

  • A302098: Number of prime factors (with multiplicity) of generalized Fermat number 14^(2^n) + 1.

  • A302203: a(n) = floor(sin(n)) + 1.

  • A302255: Total domination number of the n-antiprism graph.

  • A302302: Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.

  • A302323: Number of 2Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

  • A302329: a(0)=1, a(1)=61; for n>1, a(n) = 62*a(n-1) - a(n-2).

  • A302330: a(0)=1, a(1)=97; for n>1, a(n) = 98*a(n-1) - a(n-2).

  • A302331: a(0)=1, a(1)=141; for n>1, a(n) = 142*a(n-1) - a(n-2).

  • A302332: a(0)=1, a(1)=193; for n>1, a(n) = 194*a(n-1) - a(n-2).

  • A302393: Number of even parts in the partitions of 3n into 3 parts.

  • A302402: Total domination number of the n-ladder graph.

  • A302404: Total domination number of the n-Moebius ladder.

  • A302405: Total domination number of the n-prism graph.

  • A302488: Total domination number of the n X n grid graph.

  • A302489: Total domination number of the n-cube connected cycle graph.

  • A302507: a(n) = 4*(3^n-1).

  • A302508: Total domination number of the n X n X n grid graph.

  • A302537: a(n) = (n^2 + 13*n + 2)/2.

  • A302576: Numbers k such that k/10 + 1 is a square.

  • A302647: a(n) = (2*n^2*(n^2 - 3) - (2*n^2 + 1)*(-1)^n + 1)/64.

  • A302650: Number of minimal total dominating sets in the n-barbell graph.

  • A302689: a(n) = 4 + 2^n - 4*n.

  • A302709: a(n) = Trinomial(2*n+1, 4) = (1/6)*n*(2*n + 1)*(2*n^2 + 9*n + 1), n >= 0.

  • A302710: a(n) = trinomial(2*n, 4) = (1/6)*n*(2*n - 1)*(2*n^2 + 7*n - 3).

  • A302748: Half thrice the previous number, rounded down, plus 1, starting with 6.

  • A302757: a(n) is the smallest number whose greedy representation as a sum of terms of A126684 uses n terms.

  • A302761: Number of total dominating sets in the n-barbell graph.

  • A302773: Numerators of (3*n + 2)/12.

  • A302906: a(0) = 0; for n > 0, a(n) = a(n-1) + 5*n + 4.

  • A302909: Determinant of n X n matrix whose main diagonal consists of the first n 5-gonal numbers and all other elements are 1’s.

  • A302910: Determinant of n X n matrix whose main diagonal consists of the first n 6-gonal numbers and all other elements are 1’s.

  • A302912: Determinant of n X n matrix whose main diagonal consists of the first n 8-gonal numbers and all other elements are 1’s.

  • A302914: Determinant of n X n matrix whose main diagonal consists of the first n 10-gonal numbers and all other elements are 1’s.

  • A302942: a(n) = (2^n-1)^2*(2^n + 2).

  • A302946: Number of minimal (and minimum) total dominating sets in the 2n-crossed prism graph.

  • A302980: Size of the smallest square Minesweeper grid that allows each number from 0 to 8 to appear exactly n times.

  • A302989: a(n) = n^n + n*n + n.

  • A302999: a(n) = Product_{k=1..n} (Fibonacci(k+2) - 1).