194650

Appears in sequences

• Number of (undirected) cycles in the graph of the n-orthoplex, n>=2.at n=3A167987
• Let sequence B_n={b_m} be defined by: b_1=prime(n), b_2=prime(n+1); for m>=3, b_m=b_(m-2)+b_(m-1) if b_(m-2)+b_(m-1) is not semiprime, otherwise b_m is the least prime divisor of b_(m-2)+b_(m-1). Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded.at n=50A221218
• a(n) = n*(n + 1)*(13*n^2 + 13*n - 14)/24.at n=24A264888