74601

Appears in sequences

• A vector recursion sequence: k = -3; m = 3; l = -3; a(n)=k*{0,a(n-2),0}+m*{-(m-1)/m,a(n-1)}++m*{a(n-1),-(m-1)/m}+l*{0,0,a(n-4),0,0}.at n=48A152655
• A vector recursion sequence: k = -3; m = 3; l = -3; a(n)=k*{0,a(n-2),0}+m*{-(m-1)/m,a(n-1)}++m*{a(n-1),-(m-1)/m}+l*{0,0,a(n-4),0,0}.at n=51A152655
• E.g.f.: (3+2*sqrt(3)*exp(x/2)*sin(sqrt(3)*x/2))/(exp(-x)+2*exp(x/2)*cos(sqrt(3)*x/2)).at n=11A178963
• Numbers m such that A186711(m) = 1.at n=16A186771
• Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down; triangle T(n,k), n>=0, read by rows.at n=28A242783
• Number of permutations of [n] with exactly three (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=up and 0=down.at n=4A246223
• Number of permutations p of [n] such that p(i) > p(i+1) iff i == 2 (mod 3).at n=11A249583
• Number of linear extensions of a poset whose Hasse diagram consists of n binary shrubs with type B_n joins.at n=3A293951
• Number of ordered ways of writing the n-th n-gonal pyramidal number as a sum of n n-gonal pyramidal numbers (with 0's allowed).at n=9A336091
• Number of connected graphs, where vertices are labeled with positive integers summing to n, and where identically labeled vertices are indistinguishable and cannot be connected with an edge.at n=14A337717