Summary of block A138
Sequences in block A138
Section titled “Sequences in block A138”-
A138016: Row sums of triangle A138015.
-
A138033: a(n) = max_{ 1 <= i <= n-1 } min{ wt(i), wt(n-i) }, where wt() = A000120() is the binary weight function; a(1) = 0 by convention.
-
A138034: Expansion of (1+3*x^2)/(1-x+x^2).
-
A138037: a(0) = 0, a(n+1) = n + a(n)/(2 - a(n) mod 2).
-
A138040: Atomic number of the 2nd transition metal (group 4) in the n-th row of the periodic system of elements.
-
A138041: a(1) = 1, a(2) = 10; for n>2, a(n+1) = 4*a(n) + 6*a(n-1). Also a(n) = upper left term in the 2 X 2 matrix [1,3; 3,3].
-
A138055: Period 8: repeat 1, 3, 5, 9, 3, 1, 9, 5.
-
A138081: Number of paratopy classes (also called species, or main classes) of 4-dimensional Latin hypercubes of order n.
-
A138083: Numbers k such that (3^(2^k) + 1)/2 is prime.
-
A138097: Duplicate of A004956, for n>0.
-
A138099: Irregular triangle read by rows: T(n,k) = k + floor(n/2), 1 <= k <= ceiling(n/2).
-
A138127: Multiples of 127.
-
A138128: Powers of 127.
-
A138129: Multiples of 1729, the Hardy-Ramanujan number.
-
A138130: Powers of 1729, the Hardy-Ramanujan number.
-
A138134: a(n) = Sum_{i=0..n} Fibonacci(5*i).
-
A138148: Cyclops numbers with binary digits only.
-
A138154: Numbers n such that sigma(sigma(n))-phi(phi(n)) = 2n.
-
A138161: Erroneous version of A105195.
-
A138179: Wiener index of the prism graph Y_n on 2n nodes.
-
A138188: Expansion of (1 - 2*x - 2*x^2 - x^3)/(1 + x + x^2 - x^3 - x^4 - x^5).
-
A138219: Integers related to the volume k(n) of a unit hypersphere in n dimensions.
-
A138229: Expansion of (1-x)/(1-2x+6x^2).
-
A138230: Expansion of (1-x)/(1 - 2*x + 4*x^2).
-
A138233: a(n) = 2^(2*n+1) + 3^(2*n+1).
-
A138251: Beatty sequence of the positive root of x^3 - x^2 - 1.
-
A138252: Beatty sequence of the number t satisfying 1/s + 1/t = 1, where s is the positive root of x^3 - x^2 - 1.
-
A138288: a(n) = A054320(n) - A001078(n).
-
A138322: a(n) = 5*a(n-1) + 10*a(n-2).
-
A138339: Smallest index in A138343 which starts a plateau of n consecutive integers.
-
A138340: Expansion of (1-8x)/(1-4x+16x^2).
-
A138364: The number of Motzkin n-paths with exactly one flat step.
-
A138377: a(0) = 0, a(1) = 1, a(2) = 3, a(3) = 2; thereafter a(n) = -4*a(n-4).
-
A138395: a(n) = 6*a(n-1) - 3*a(n-2), a(1) = 1, a(2) = 6.
-
A138466: a(1)=1; for n >= 2, a(n) = n - floor((1/2)*a(a(n-1))).
-
A138467: a(1)=1, then for n>=2 a(n) = n - floor((1/3)*a(a(n-1))).
-
A138473: a(n) = Fibonacci(8*n).
-
A138513: a(n) = 8*a(n-1) - 5*a(n-2).
-
A138523: a(n) = Sum_{k=1..n} (2k-1)!.
-
A138524: a(n) = Sum_{k=1..n} (2*k)!.
-
A138525: a(n) = Sum_{k=0..n} (2*k)!.
-
A138531: Decimal expansion of 109739369/111111111.
-
A138564: a(1) = 1; a(n) = a(n-1) + (n!)^3.
-
A138589: a(n) = 5^n mod 4^n.
-
A138590: a(n) = Fibonacci(9*n).
-
A138611: 6^n mod 4^n.
-
A138616: a(n) = 7^n mod 2^n.
-
A138617: a(n) = 7^n mod 3^n.
-
A138648: 7^n mod 5^n.
-
A138649: a(n) = 6^n mod 5^n.
-
A138654: 7^n mod 4^n.
-
A138709: n-th run has length n-th positive Fibonacci numbers, with digits 0 and 1 only, starting with 1.
-
A138710: n-th run has length n-th positive Fibonacci numbers, with digits 0 and 1 only, starting with 0.
-
A138748: a(n) = (n+(n+1)) + (n*(n+1)) + (n^(n+1)).
-
A138750: a(n) = ceiling(n/2) if n == 2 (mod 3), a(n) = 2n otherwise.
-
A138772: Number of entries in the second cycles of all permutations of {1,2,…,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.
-
A138782: a(n) = n*(3*n-1)*n!/2.
-
A138790: Numbers k such that A138793(k) is prime.
-
A138830: Bisection of imperfect numbers A132999.
-
A138836: Non-Mersenne numbers A001348.
-
A138849: a(n) = AlexanderPolynomial[n] defined as Det[Transpose[S]-n S] where S is Kronecker Product of two 2 X 2 Seifert matrices {{-1, 1}, {0, -1}} [X] {{-1, 1}, {0, -1}} = {{1, -1, -1, 1}, {0, 1, 0, -1}, {0, 0, 1, -1}, {0, 0, 0, 1}}.
-
A138894: Expansion of (1+x)/(1-10*x+9*x^2).
-
A138896: Ratio of (2n-1)! to number of zeros in Sylvester matrix of polynomial of n degree with all nonzero coefficients.
-
A138897: Ratio of (2n-1)! to number of zeros in upper part of Sylvester matrix of polynomial of degree n with all nonzero coefficients.
-
A138898: Ratio of (2*n-1)! to number of zeros in lower part of Sylvester matrix for polynomial of degree n with all nonzero coefficients.
-
A138955: a(n) = 8^n mod 3^n.
-
A138959: a(n) = 8^n mod 5^n.
-
A138964: a(n) = 8^n mod 6^n.
-
A138973: a(n) = 8^n mod 7^n.
-
A138977: Number of 2 X n matrices containing a 1 in the top left entry, all entries are integer values and adjacent entries differ by at most 1.
-
A138984: a(n) = Frobenius number for 4 successive numbers = F(n+1, n+2, n+3, n+4).
-
A138985: a(n) = Frobenius number for 5 successive numbers = F(n+1, n+2, n+3, n+4, n+5).
-
A138986: a(n) = Frobenius number for 6 successive numbers = F(n+1, n+2, n+3, n+4, n+5, n+6).
-
A138987: a(n) = Frobenius number for 7 successive numbers = F(n+1, n+2, n+3, n+4, n+5, n+6, n+7).
-
A138988: a(n) is the Frobenius number for 8 successive numbers n+1, n+2, …, n+8.
-
A138998: 9^n mod 2^n.