24453

Appears in sequences

• a(n) = b(n) - c(n) where b(n) is the n-th Lucas number greater than 3 and c(n) is the n-th number not in sequence b( ).at n=18A014252
• Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=37A028268
• Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=32A028274
• Partial sums of A027818.at n=8A034266
• a(n) = f(n,n-2) where f is given in A034261.at n=7A034275
• Numerators of continued fraction convergents to sqrt(708).at n=9A042362
• a(n) = C(n)*(8*n+1) where C(n) = Catalan numbers (A000108).at n=7A050478
• Number of polyiamonds with n cells, without holes.at n=13A070765
• Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=16A087414
• Numbers which are the sum of two positive cubes and divisible by 11.at n=33A101852
• a(n) = n*(n+1)*(8*n + 1)/6.at n=26A132124
• Numbers k whose sum of digits equals the period of 1/k.at n=39A178495
• Numbers n dividing every cyclic permutation of n^4.at n=29A242740
• Triangle where g.f. C = C(x,m) and related series S = S(x,m) and D = D(x,m) satisfy S = x*C*D, C = 1 + x*S*D, and D = 1 + m*x*S*C, as read by rows of coefficients T(n,k) of x^(2*n)*m^k in C(x,m) for n>=0, k=0..n.at n=68A278881
• Triangle where g.f. D = D(x,m) and related series S = S(x,m) and C = C(x,m) satisfy S = x*C*D, C = 1 + x*S*D, and D = 1 + m*x*S*C, as read by rows of coefficients T(n,k) of x^(2*n)*m^k in C(x,m) for n>=1, k=0..n.at n=75A278882
• Approximation of the 2-adic integer exp(-4) up to 2^n.at n=15A321689
• Number of double palindrome structures of length n using a maximum of four different symbols.at n=14A328693
• Number of n X 3 0..2 matrices with row sums 3 and column sums n up to permutations of rows.at n=48A377067