|
|
A016957
|
|
a(n) = 6*n + 4.
|
|
57
|
|
|
4, 10, 16, 22, 28, 34, 40, 46, 52, 58, 64, 70, 76, 82, 88, 94, 100, 106, 112, 118, 124, 130, 136, 142, 148, 154, 160, 166, 172, 178, 184, 190, 196, 202, 208, 214, 220, 226, 232, 238, 244, 250, 256, 262, 268, 274, 280, 286, 292, 298, 304, 310, 316, 322, 328
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Number of 2 X n binary matrices avoiding simultaneously the right-angled numbered polyomino patterns (ranpp) (00;1), (01,1) and (11;0). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1 < i2, j1 < j2 and these elements are in the same relative order as those in the triple (x,y,z). In general, the number of m X n 0-1 matrices in question is given by (n+2)*2^(m-1) + 2*m*(n-1) - 2 for m > 1 and n > 1. - Sergey Kitaev, Nov 12 2004
If Y is a 4-subset of an n-set X then, for n >= 4, a(n-4) is the number of 3-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 08 2007
4th transversal numbers (or 4-transversal numbers): Numbers of the 4th column of positive numbers in the square array of nonnegative and polygonal numbers A139600. Also, numbers of the 4th column in the square array A057145. - Omar E. Pol, May 02 2008
a(n) is the maximum number such that there exists an edge coloring of the complete graph with a(n) vertices using n colors and every subgraph whose edges are of the same color (subgraph induced by edge color) is planar. - Srikanth K S, Dec 18 2010
Also numbers having two antecedents in the Collatz problem: 12*n+8 and 2*n+1 (respectively A017617(n) and A005408(n)). - Michel Lagneau, Dec 28 2012
a(n) = 6n+4 has three undirected edges e1 = (3n+2, 6n+4), e2 = (6n+4, 12n+8) and e3 = (2n+1, 6n+4) in the Collatz graph of A006370. - Heinz Ebert, Mar 16 2021
Conjecture: this sequence contains some but not all, even numbers with odd abundance A088827. They appear in this sequence at indices A186424(n) - 1. - John Tyler Rascoe, Jul 09 2022
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 189. - From N. J. A. Sloane, Dec 01 2012
|
|
LINKS
|
|
|
FORMULA
|
a(n) = floor((sqrt(36*n^2 - 36*n + 1) + 6*n + 1)/2). - Srikanth K S, Dec 18 2010
G.f.: 2*(2+x)/(1-2*x+x^2).
a(n) = 2*a(n-1) - a(n-2). (End)
Sum_{n>=0} (-1)^n/a(n) = sqrt(3)*Pi/18 - log(2)/6. - Amiram Eldar, Dec 10 2021
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Maxima) makelist(6*n+4, n, 0, 30); /* Martin Ettl, Nov 12 2012 */
(Haskell)
|
|
CROSSREFS
|
Cf. A006370, A008588, A016921, A016933, A016945, A016969, A000217, A017329, A057145, A139600, A139606, A016958, A186424.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|