19688

Appears in sequences

• Numbers that are the sum of 8 nonzero 8th powers.at n=24A003386
• Numbers that are the sum of 6 positive 9th powers.at n=7A003395
• Numbers that are the sum of at most 6 positive 9th powers.at n=33A004890
• Numbers k such that sigma(k+2) = sigma(k).at n=26A007373
• Number of ways to place 4 nonattacking queens on a 4 X n board.at n=16A061990
• Numbers k such that A065608(k) = A065608(k+2).at n=13A065064
• a(n) = n^3 + 5.at n=27A084381
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, -1), (0, 1, 1), (1, -1, 0)}.at n=9A148870
• Index of first occurrence of n in A154404.at n=38A154952
• Transform of the finite sequence (1, 0, -1) by the T_{1,1} transformation (see link).at n=11A159329
• a(n) = 3^n + 5.at n=9A168610
• Number of (n+1) X (n+1) 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.at n=1A206181
• Number of (n+1) X 3 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.at n=1A206182
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.at n=4A206188
• Numbers k such that k and k+2 have the same number (A000005) and sum of divisors (A000203).at n=10A229254
• Number of nX4 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors exactly one smaller than itself.at n=5A266021
• Number of nX6 integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors exactly one smaller than itself.at n=3A266023
• T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors exactly one smaller than itself.at n=39A266025
• T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors exactly one smaller than itself.at n=41A266025
• Numbers whose deficiency is a perfect number.at n=18A302125