19572

Appears in sequences

• a(n) = T(2n,n+3), T given by A026736.at n=6A026852
• Triangle given by T(n,k) = Fibonacci(n+k+1)*binomial(n,k) for 0<=k<=n.at n=48A122070
• a(n) = 25*n^2 - n.at n=27A157514
• a(n) = 100*n^2 - 2*n.at n=14A158129
• a(n) = 529*n - 1.at n=36A158365
• a(n) = 784*n^2 - 28.at n=4A158657
• A binomial transform of Fibonacci numbers.at n=51A185384
• Number of n X 7 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 1 vertically.at n=11A208779
• Number of 0..n arrays of length 7 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=11A221686
• Twice partitioned numbers where the first partition is strict.at n=17A271619
• Wiener index of the n-Apollonian network.at n=4A289022
• The first Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1).at n=23A292344
• Partial sums of A294016.at n=43A294017
• Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=13A298632
• Lengths of largest face diagonal in primitive Euler bricks or Pythagorean cuboids: possible values of max(d, e, f) for solutions to a^2 + b^2 = d^2, a^2 + c^2 = e^2, b^2 + c^2 = f^2 in coprime positive integers a, b, c, d, e, f.at n=24A306120
• Numbers k such that (Sum of totatives of k) == 1 (mod Sum of primes dividing k with multiplicity).at n=42A340299
• a(n) = Sum_{k=1..n} floor(n/k) * 5^(k-1).at n=6A344816
• Numbers that are the sum of eight fourth powers in eight or more ways.at n=32A345583
• Numbers that are the sum of eight fourth powers in nine or more ways.at n=12A345584
• Numbers that are the sum of eight fourth powers in exactly nine ways.at n=8A345841