20848

Appears in sequences

• Starting from generation 7 add previous and next term yielding generation 8.at n=37A048454
• Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.at n=39A050792
• Number of connected oriented graphs (i.e., connected directed graphs with no bidirected edges) on n nodes.at n=6A086345
• Positive integers of the form (7*m^2+1)/11.at n=32A179370
• Triangle read by rows: Kreweras's "Rule A_4 left thickness" numbers.at n=40A259099
• Expansion of Product_{k>=0} ((1+x^(3*k+1))/(1-x^(3*k+1)))^2.at n=26A261649
• Triangle read by rows: Number of oriented graphs on n nodes with k components.at n=22A281446
• a(n) = prime(n) + prime(n+1) * prime(n+2).at n=32A293206
• Numbers k such that there is no prime p and index j > k such that A002182(j) = p * A002182(k).at n=7A309042
• a(n) is the numerator of the expected depth of the tree representing the process of eliminating from n people a random group by tossing coins, and repeating this process recursively until a single loser is determined.at n=9A372422