Skip to content

Summary of block A061

63 sequences
  • A061006: a(n) = (n-1)! mod n.

  • A061007: a(n) = -(n-1)! mod n.

  • A061062: Sum of squared factorials: (0!)^2 + (1!)^2 + (2!)^2 + (3!)^2 +…+ (n!)^2.

  • A061079: Denominators in the series for sin integral Si(x).

  • A061084: Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).

  • A061094: The alternating group A_n contains an element x which is not conjugate to its inverse (equivalently not all the entries in the character table of A_n are real numbers).

  • A061100: Squares with digital root 4.

  • A061102: Duplicate of A016779.

  • A061103: Duplicate of A016791.

  • A061167: a(n) = n^5 - n.

  • A061168: Partial sums of floor(log_2(k)) (= A000523(k)).

  • A061190: a(n) = n^n - n.

  • A061206: a(n) = total number of occurrences of the consecutive pattern 1324 in all permutations of [n+3].

  • A061213: a(n) = 1 + product of first n positive triangular numbers (A000217).

  • A061222: a(n) = n^2 + (n + 1)^3 + (n + 2)^4.

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

  • A061253: Let G_n be the elementary Abelian group G_n = (C_3)^n; a(n) is the number of times the number 1 appears in the character table of G_n.

  • A061263: a(n) = floor(n^3/9).

  • A061278: a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) with a(1) = 1 and a(k) = 0 if k <= 0.

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

  • A061302: a(n) = n! * [x^n] W(-x)*(W(-x) + 2)/(W(-x) + 1), where W denotes Lambert’s W function.

  • A061316: a(n) = n*(n+1)*(n^2 + n + 4)/4.

  • A061317: Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, …

  • A061322: a(n) = a(n-1) * (1 + a(n-1)/n^2) with a(0) = 2.

  • A061347: Period 3: repeat [1, 1, -2].

  • A061370: a(n) = floor(ratio of product and sum of first n numbers).

  • A061397: Characteristic function sequence of primes multiplied componentwise by N, the natural numbers.

  • A061418: a(n) = floor(a(n-1)*3/2) with a(1) = 2.

  • A061419: a(n) = ceiling(a(n-1)*3/2) with a(1) = 1.

  • A061501: a(1) = 1, a(n+1) = (a(n) + n) mod 10.

  • A061547: Number of 132 and 213-avoiding derangements of {1,2,…,n}.

  • A061550: a(n) = (2*n+1)*(2*n+3)*(2*n+5).

  • A061570: a(1)=0, a(2)=1, a(n)=3*n-1 for n >= 3.

  • A061573: a(n) = (n!)^2*Sum_{k=1..n} 1/k!.

  • A061600: a(n) = n^3 - n + 1.

  • A061640: a(n) = !n*n!.

  • A061647: Beginning at the well for the topograph of a positive definite quadratic form with values 1, 1, 1 at a superbase (i.e., 1, 1 and 1 are the vonorms of the superbase), these numbers indicate the labels of the edges of the topograph on a path of greatest ascent.

  • A061650: a(n) = n*20^(n-1).

  • A061654: a(n) = (3*16^n + 2)/5.

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

  • A061679: Concatenation of n^3 and 7.

  • A061705: Number of matchings in the wheel graph with n spokes.

  • A061711: a(n) = n^n * n!.

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

  • A061719: a(n) = Product_{k=0…n} (k!^3).

  • A061722: a(n) = 10*n^2 + 7.

  • A061726: If n-th triangular number (A000217(n)) is odd, multiply it by 4; if even, multiply it by 5.

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

  • A061776: Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives number of triangles in n-th generation.

  • A061788: a(n) = Sum_{k=1..n} (2k)^(2k).

  • A061792: a(n) = 49*(n*(n+1)/2) + 6.

  • A061793: a(n) = 25*n*(n + 1)/2 + 3.

  • A061800: a(n) = n + (-1)^(n mod 3).

  • A061801: a(n) = (7*6^n - 2)/5.

  • A061803: Sum of n-th row of triangle of 4th powers: 1; 1 16 1; 1 16 81 16 1; 1 16 81 256 81 16 1; … (cf. A133824).

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

  • A061834: a(n) = binomial(n,2) * !n.

  • A061908: Duplicate of A056020.

  • A061925: a(n) = ceiling(n^2/2) + 1.

  • A061927: a(n) = n*(n+1)*(2*n+1)*(n^2+n+3)/30.

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

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

  • A061983: a(n) = 3^n - (3*n^2 + n + 2)/2.