19958

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (F(2), F(3), ...).at n=15A024472
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (F(2), F(3), F(4), ...).at n=14A025092
• Numerators of continued fraction convergents to sqrt(504).at n=4A041962
• a(n) = floor(sqrt(a(n-1)^2 + a(n-2)^2)), a(1)=100, a(2)=300.at n=19A104908
• Triangle read by rows: T(n,k) (0 <= k <= ceiling(n/2)-2) is the number of (1,1) steps starting at level k in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology).at n=52A110238
• Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, -1), (1, 1)}.at n=12A151353
• a(n) = 121*n^2 - 38*n + 3.at n=12A157443
• Number of partitions of n with up to seven distinct kinds of 1.at n=24A320694
• Numbers k such that 427*2^k+1 is prime.at n=31A323114
• Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k >= 0 steps (and no fewer) by n >= 1 agents using the ANY protocol (see A318154).at n=40A383386
• Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.at n=7A385339