25048

Appears in sequences

• 4-white numbers: partition digits of n^4 into blocks of 4 starting at right; sum of these 4-digit numbers equals n.at n=15A037044
• a(n) = sum of the first n coefficients of (1+x+x^2)^n.at n=9A055217
• Structured truncated tetrahedral numbers.at n=23A100156
• a(n) = a(n-1)+floor(a(n-2)/4) with a(0)=3, a(1)=4.at n=50A182230
• Sums of knight's moves over the square |i|+|j|<=n on infinite chessboard.at n=35A183053
• Number of 0..2 arrays of length n+9 with sum less than 10 in any length 10 subsequence (=less than 50% duty cycle).at n=0A212726
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum less than 2*k in any length 2k subsequence (=less than 50% duty cycle).at n=10A212729
• Number of 0..2 arrays of length 2*n with sum less than 2*n in any length 2n subsequence (=less than 50% duty cycle).at n=4A212730
• Not appropriate for the OEIS.at n=8A248690
• Numbers n representable as x*y + x + y, where x >= y > 1, such that all x's and y's in all representation(s) of n are perfect squares.at n=32A258366
• a(n) is the least integer k such that k/Fibonacci(n) > sqrt(2).at n=22A293419
• a(n) is the number of vertices in the diagram of partitions of n (see example).at n=32A299475