48704

Appears in sequences

• For n >= 2, a(n) = b(n+1)+b(n)+b(n-1), where the b(i) are the ménage numbers A000179; a(0)=a(1)=1.at n=8A000270
• Numbers k such that phi(k) = phi(k+1).at n=27A001274
• a(n) = T(3n,n), where T is the array defined in A024996.at n=6A026074
• Triangle of coefficients of generating function of 5-ary rooted trees of height at most n.at n=64A036607
• Number of 5-ary rooted trees with n nodes and height at most 4.at n=22A036615
• Numbers that appear exactly five times in A101402. (Also indices of fives in A101403.).at n=33A129117
• A number n is included in the sequence if and only if the n-th integer from among those positive integers which are coprime to n+1 = the (n+1)-st integer from among those positive integers which are coprime to n.at n=9A139766
• Triangle read by rows: t(n,k)=Binomial[n, k] + Binomial[k*(n - k), n].at n=48A155798
• Triangle read by rows: t(n,k)=Binomial[n, k] + Binomial[k*(n - k), n].at n=51A155798
• Numbers k such that lambda(k) = lambda(k+1).at n=33A173695
• Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.at n=46A335391