Summary of block A137
Sequences in block A137
Section titled “Sequences in block A137”-
A137002: Numbers k such that k and k^2 use only the digits 1, 2 and 5.
-
A137120: Numbers k such that k and k^2 use only the digits 3, 4, 5 and 6.
-
A137146: Numbers k such that k and k^2 use only the digits 5, 6, 7 and 8.
-
A137173: A006516 at positions with even indices, A007582 at positions with odd indices.
-
A137199: a(n)=a(n-1)+3a(n-2)+a(n-3).
-
A137206: First differences of A074323.
-
A137208: a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n > 2; a(0)=2, a(1)=3, a(2)=6.
-
A137212: a(n) = 5*a(n-1) - 5*a(n-2) - 3*a(n-3).
-
A137213: First differences of A137212.
-
A137221: a(n) = 5*a(n-1) - 9*a(n-2) + 8*a(n-3) - 4*a(n-4), with a(0)=0, a(1)=0, a(2)=0, a(3)=1.
-
A137224: Interleave 4*n^2, 1+4*n^2, 1+(2n+1)^2, (2n+1)^2 (or A016742, A053755, A069894, A016754).
-
A137228: Minimal total number of edges in a polyiamond consisting of n triangular cells.
-
A137233: Number of n-digit even numbers.
-
A137235: a(n) = (n+1)/2 if n is odd; a(n) = n/2 + 6 if n is even.
-
A137237: Number of non-isomorphic drawings of K_n with minimum crossings.
-
A137253: Semiprimes (A001358) which are not the sum of two semiprimes.
-
A137280: a(n) = 3*a(n-1) + 7*a(n-2), with a(1) = 1, a(2) = 10.
-
A137290: Fibonacci(n) mod 30.
-
A137325: Number of terms in the Janet periodic table of the elements 32 columns: ordered 14 2’s, 10 4’s, 6 6’s, 2 8’s.
-
A137331: a(n) = 1 if the binary weight of n is prime, otherwise 0.
-
A137340: a(n) = 2*a(n-1) + 3*a(n-2), with a(0) = 1, a(1) = 9.
-
A137344: a(n)=4a(n-2). Also 3*A084221.
-
A137353: Minimal number of edges in an n-stable graph.
-
A137392: (10-n) * Fibonacci(n).
-
A137399: a(n)=4a(n-4).
-
A137410: a(n) = (5^n - 3)/2.
-
A137426: a(n)=-a(n-1)+2a(n-3).
-
A137429: a(n) = -2*a(n-1) - 2*a(n-2), with a(0)=1 and a(1)=-4.
-
A137444: a(n) = 2*a(n-1) - 2*a(n-2) with a(0)=1, a(1)=4.
-
A137445: a(n) = 2a(n-1)-2a(n-2), with a(0)=3 and a(1)=2.
-
A137466: 1 concatenated with n 21’s.
-
A137467: a(n) = i + j - k, where n = p(i) + p(j) - p(k), such that p(i), p(j), and p(k) are distinct primes, i + j - k = minimum, and n >= 3.
-
A137470: Inverse binomial transform of 1, 2, 2, 4, 10, 20, … = A100088.
-
A137483: a(n+1) = 9*a(n) - 6, a(0) = 2.
-
A137501: The even numbers repeated, with alternating signs.
-
A137505: Inverse binomial transform of A007910.
-
A137512: The number of nodes visible from underneath a binary tree, where the nodes are placed such that the innermost of the two sprouting nodes should be underneath the mother.
-
A137517: a(0) = 121; for n>0, a(n) = a(n-1) - n + 1.
-
A137565: Hankel transform of quadruple factorial numbers A001813.
-
A137583: Number of elements in the n-th period of the Janet periodic table of elements.
-
A137592: Duplicate of A098694.
-
A137697: a(n) = x(n) * 2^((n mod 2 - 1)/2), with x(n)=Sum(x(k)*x(n-k-1):0<=k<n), x(0)=SQRT(2).
-
A137704: Hankel transform of aerated factorial numbers.
-
A137709: Secondary upper Wythoff sequence.
-
A137717: Hankel transform of A106191.
-
A137718: A scaled Hankel transform.
-
A137719: Sequence based on the pattern [3n, 3n, 3n, 3n+2, 3n+1, 3n+2].
-
A137730: Number of circular permutations of the multiset {1,1,2,2,…,n,n} (up to rotations) with odd distances between equal elements.
-
A137742: a(n) = (n-1)*(n+4)*(n+6)/6 for n > 1, a(1)=1.
-
A137786: a(n) = 4^n - 3^n - 2^n.
-
A137787: a(n) = 5^n - 4^n - 3^n - 2^n.
-
A137797: a(n) = 2*( (n+1) mod 5 ) - 2*( (n+1) mod 2 ).
-
A137798: Partial sums of A137797.
-
A137803: a(n) = floor(n*(sqrt(2) + 1/2)).
-
A137810: a(n) = 2^(2^n+n) - 1.
-
A137840: Number of distinct n-ary operators in a quaternary logic.
-
A137841: Number of distinct n-ary operators in a quinternary logic.
-
A137864: a(n) = n^4 - 10n^3 + 35n^2 - 48n + 23.
-
A137882: Number of (directed) Hamiltonian paths in the n-ladder graph.
-
A137928: The even principal diagonal of a 2n X 2n square spiral.
-
A137931: Sum of the principal diagonals of a 2n X 2n square spiral.
-
A137932: Terms in an n X n spiral that do not lie on its principal diagonals.
-
A137933: Least common multiple of n^2 and 2.
-
A137934: Period 6: 2,2,2,2,2,0.
-
A137936: a(n) = 5*mod(n,5) + floor(n/5).