42966

Appears in sequences

• Number of 5-leaf rooted trees with n levels.at n=20A007715
• a(n) = T(n,n-3), where T is the array in A026374.at n=41A026382
• Write cosec x = 1/x + Sum e_n x^(2n-1)/(2n-1)!; sequence gives denominators of e_n.at n=14A036283
• Numbers k such that 7^k == -1 (mod k-1).at n=17A055690
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^4-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=40A096035
• A Jacobsthal-Pascal triangle.at n=49A124860
• A Jacobsthal-Pascal triangle.at n=50A124860
• a(0) = 2, a(1) = 2, and for n > 1, a(n) = a(n-1) + a((a(n-1) - 1) mod n).at n=35A145465
• Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives numbers belonging to cycles, including fixed points.at n=12A165017
• Consider the base-4 Kaprekar map n->K(n) defined in A165012. Sequence gives numbers belonging to cycles of length greater than 1.at n=5A165019
• Numbers k for which 6k+1, 24k+5, 432k^2+72k-1, and 432k^2+90k-1 are all prime.at n=37A175513
• 15-gonal (or pentadecagonal) pyramidal numbers: a(n) = n*(n+1)*(13*n-10)/6.at n=27A177890
• Number of ballot results from n voters that prompt a run-off election when three candidates vie for two spots on a board.at n=11A224711
• Number of partitions of n containing m(1) as a part, where m denotes multiplicity.at n=46A240486
• Number of partitions p of n such that the number of parts is a part or max(p) - min(p) is a part.at n=48A241386
• Number of smallest coverings of the n-dipyramidal graph by maximal cliques.at n=18A298648
• a(n) = denominator(4^(n + 1)*zeta(-n, 1/4)).at n=29A344918
• G.f. satisfies A(x) = 1 / ((1-x)^3 - x*A(x)^3).at n=5A376160