26913

Appears in sequences

• Expansion of tan(tan(sin(x))).at n=4A009690
• Sum of end-to-end Manhattan distances over all self-avoiding walks on square lattice trapped after n steps.at n=8A078800
• a(0) = 1, a(1)= 2, a(n) = (a(n+1) - a(n-1))/n, or a(n+1) = n*a(n) + a(n-1).at n=8A093858
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k DDUU's, where U=(1,1), D=(1,-1) (0<=k<=floor(n/2)-1 for n>=2).at n=28A114492
• a(n) = 841*n + 1.at n=31A158404
• a(n) = 32*n^2 + 1.at n=29A158575
• The number of valleys of width 1 (i.e., DHU configurations, where U=(0,1), H(1,0), D=(0,-1)) in all bargraphs of semiperimeter n (n>=2).at n=11A273722
• Numbers k such that prime(k+1)^prime(k+3) == prime(k) mod prime(k+2).at n=17A335571
• a(n) = Sum_{k=1..n} k^3 * phi(k).at n=10A344526