Skip to content

Summary of block A091

66 sequences
  • A091000: Number of closed walks of length n on the Petersen graph rooted at a given vertex.

  • A091001: Number of walks of length n between adjacent nodes on the Petersen graph.

  • A091002: Number of walks of length n between non-adjacent nodes on the Petersen graph.

  • A091003: Expansion of (1-3*x^2)/((1-2*x)*(1+3*x)).

  • A091005: Expansion of x^2/((1-2*x)*(1+3*x)).

  • A091030: Partial sums of powers of 13 (A001022).

  • A091032: Second column (k=3) of array A090438 ((4,2)-Stirling2) divided by 8.

  • A091037: Second column (k=5) of array A090214 ((4,4)-Stirling2) divided by 4*4!=96.

  • A091045: Partial sums of powers of 17 (A001026).

  • A091052: Record values in A091023.

  • A091068: a(0) = 0; for n>0, a(n) = a(n-1) - n if that is >= 0, else a(n) = a(n-1) + n - 1.

  • A091084: a(n) = A001045(n) mod 10.

  • A091085: a(n) = mod(A078008(n),10).

  • A091086: a(n) = A000975(n) mod 10.

  • A091130: Number of polydudes(2): a(n) is the number of polydudes with n cells. See the link for the definition. Not the same as A056843.

  • A091143: Number of Pythagorean triples mod 2^n; i.e., number of solutions to x^2 + y^2 = z^2 mod 2^n.

  • A091270: Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.

  • A091307: a(n)=6*2^n+4 (Bode Number A003461(n+2)) except for a(1)=6.

  • A091323: Minimum number of transversals in a Latin square of order 2n+1.

  • A091338: a(n) = (3/n), where (k/n) is the Kronecker symbol.

  • A091339: a(n) = a(n-1)*a(n-2) + (n-2); a(1) = 1, a(2) = 2.

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

  • A091361: Numbers n such that A001840(n) == 0 (mod n).

  • A091363: a(n) = n!*n^3.

  • A091364: a(n) = n! * n^4.

  • A091401: Numbers n such that genus of group Gamma_0(n) is zero.

  • A091402: Erroneous version of A091401.

  • A091409: a(n) is the smallest m such that A090822(m) = n.

  • A091482: a(n) = (3*n)^n.

  • A091483: a(n) = (4*n)^n.

  • A091502: Number of n X n matrices with entries {-1,0,1} that are diagonalizable over the real numbers.

  • A091519: G.f.: Sum_{k>=0} (2^k*t*(1+t)/(1-t)^3, t=x^2^k).

  • A091535: First column (k=2) of array A091534 ((5,2)-Stirling2).

  • A091544: First column sequence of array A091746 ((6,2)-Stirling2).

  • A091574: Poincaré series [or Poincare series] of the preprojective algebra of an extended Dynkin diagram of type D_4.

  • A091628: Concatenation of n 2’s followed by 3.

  • A091629: Product of digits associated with A091628(n). Essentially the same as A007283.

  • A091669: a(n) = (2^(n-1)/n!) * Product_{k=1..n-1} (2^k-1).

  • A091684: a(n) = 0 if n is divisible by 3, otherwise a(n) = n.

  • A091685: Sieve out 6n+1 and 6n-1.

  • A091686: a(n) = 0^n + ((n-9)/9)*(1-10^n).

  • A091692: (10^n-1) * (n+9) / 9.

  • A091693: a(n) = (n*10^n - n + 9)/9.

  • A091703: Count, setting 5n to zero.

  • A091761: a(n) = Pell(4n) / Pell(4).

  • A091804: a(n) = 2^(n*(n+1)/2)*A055209(n).

  • A091810: Hankel transform of the sequence A001469 (unsigned), Genocchi numbers of first kind.

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

  • A091848: Johnson bound J(n,4,2).

  • A091868: a(n) = (n!)^(n+1).

  • A091870: A trinomial transform of Fibonacci(3n).

  • A091881: Expansion of (1-11x)/((1-x)(1-16x)).

  • A091882: Expansion of g.f. (1-10x)/(1-15x).

  • A091883: Expansion of (1-5x)/((1+5x)(1-10x)).

  • A091904: Expansion of x/((1+4x)(1-8x)).

  • A091905: Expansion of (1-4x)/((1+4x)(1-8x)).

  • A091914: a(n) = 2*a(n-1) + 12*a(n-2).

  • A091927: Expansion of (1-6x)/(1-6x-5x^2).

  • A091928: a(0)=1, a(1)=5; a(n) = 6*a(n-1) + 5*a(n-2) for n > 1.

  • A091929: Expansion of (1-6x)/(1-6x-11x^2).

  • A091940: Given n colors, sequence gives number of ways to color the vertices of a square such that no edge has the same color on both of its vertices.

  • A091946: a(n) = floor(11^n/10^n).

  • A091947: (Fractional part of 1.1^n) * 10^n.

  • A091972: Expansion of g.f. (1 + x^5 ) / ( (1-x^3)*(1-x^4)).

  • A091998: Numbers that are congruent to {1, 11} mod 12.

  • A091999: Numbers that are congruent to {2, 10} mod 12.