Summary of block A124
Sequences in block A124
Section titled “Sequences in block A124”-
A124007: Number of permutations of n distinct letters (ABCD…) each of which appears thrice with n-3 fixed points.
-
A124011: Add three, add six, add nine, …
-
A124023: G.f.: 1/(1-2*x-6*x^2+4*x^3).
-
A124045: Numbers n such that n^2 divide A123269(n) = Sum[ i^j^k, {i,1,n}, {j,1,n}, {k,1,n} ].
-
A124072: First differences of A129819.
-
A124075: a(n) = 2^(3^(4^…^n)…).
-
A124079: a(n) = H(2n+1)*(2n+1)!/n!, where H(n) = Sum_{k=1..n} 1/k, the n-th harmonic number.
-
A124080: 10 times triangular numbers: a(n) = 5*n*(n + 1).
-
A124082: Numbers k such that prime(k)!/prime(k)# - 1 is prime.
-
A124089: a(n) = binomial(n,6)-1.
-
A124090: C(n,7)-1.
-
A124133: a(n) = (-1/2)*Sum_{i1 + i2 + i3 = 2*n} ((2*n)!/(i1! i2! i3!))*B(i1), where B are the Bernoulli numbers (with i1, i2, i3 >= 1).
-
A124152: a(n) = Fibonacci(6, n).
-
A124157: Maximal number of edges in a doubly linear graph with n nodes.
-
A124159: Maximal order of a complete graph that is the union of two graphs which can both be embedded on a sphere with n handles.
-
A124166: a(n) = 100*(10^n - 1)/9.
-
A124167: a(n) = 10*(10^n-1).
-
A124193: Points that add to make a shape, with each new shape enclosing the old shape. Also the creation of each shape must not copy any former shape’s angle/points/length/name/ratios/etc. and the number of points as a whole for the series must be kept to a min. Only 3d shapes are used.
-
A124274: Nonprime numbers k that divide A124271(k) = Sum_{i=1..k} (prime(i)^k - 1) / (prime(i) - 1).
-
A124275: Terms of A123856 that are not terms of A124273.
-
A124302: Number of set partitions with at most 3 blocks; number of Dyck paths of height at most 4; dimension of space of symmetric polynomials in 3 noncommuting variables.
-
A124303: Number of set partitions of length <= 4; sum of first 4 columns of triangle of Stirling numbers of 2nd kind; dimension of space of symmetric polynomials in 4 noncommuting variables.
-
A124349: Numbers of directed Hamiltonian cycles on the n-prism graph.
-
A124350: a(n) = 4*n*(floor(n^2/2)+1). For n >= 3, this is the number of directed Hamiltonian paths on the n-prism graph.
-
A124351: Order of the automorphism group of the n-prism graph.
-
A124354: Orders of the automorphisms groups of the n-antiprism graph.
-
A124355: Number of (directed) Hamiltonian cycles on the complete graph K_n.
-
A124356: Number of (directed) Hamiltonian cycles on the Moebius ladder graph M_n (for n>=4).
-
A124363: a(n) = n^3 + 71*n + 1.
-
A124388: a(n) = 27*n + 18.
-
A124437: Experience Points thresholds for levels in the pen and paper role-playing game “Das Schwarze Auge” (DSA, a.k.a. “The Dark Eye”).
-
A124610: a(n) = 5*a(n-1) + 2*a(n-2), n > 1; a(0) = a(1) = 1.
-
A124647: a(n) = (2n + 1)*3^n.
-
A124649: Numbers n such that n^i (i=1..8) are all zeroless.
-
A124657: Factorials that are abundant numbers.
-
A124671: Row sums of A126277 = binomial transform of (1, 2, 2, 3, 4, 4, 4, …)
-
A124677: Minimal total number of multiplications by single letters needed to generate all words of length n in the free monoid on two generators.
-
A124696: Number of base-3 circular n-digit numbers with adjacent digits differing by 1 or less.
-
A124797: Sum of cyclic permutations of 123…n seen as number written in base n+1: ((n+1)^n-1)*(n+1)/2.
-
A124820: Expansion of (1-x)/(1-4*x+3*x^2-x^3).
-
A124861: Expansion of 1/(1-x-3*x^2-4*x^3-2*x^4).
-
A124862: a(n)=J(2n+1)*C(2n,n), J(n)=A001045(n).
-
A124867: Numbers that are the sum of 3 distinct primes.
-
A124868: Natural numbers that are not the sum of 3 distinct primes.
-
A124899: Sierpinski quotient ((2n-1)^(2n-1) + 1)/(2n) = A014566(2n-1)/(2n).
-
A124923: a(n) = n^(n-1) + 1.