28671

Appears in sequences

• Number of points of norm <= n in cubic lattice.at n=19A000605
• a(n) = (n+3)*2^n - 1.at n=12A006589
• a(n) = 2*a(n-2) + 1.at n=25A010737
• a(n) = Sum_{k=0..floor(n/2)} A026615(n, k).at n=15A026623
• Concatenations C1 and C2 and C3 are all prime (see the comment lines).at n=8A034818
• Numbers having four 7's in base 8.at n=6A043452
• a(n) = Fibonacci(n) OR Fibonacci(n+1).at n=22A051123
• Closed 3-dimensional ball numbers (version 1): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (0,0,0).at n=38A053591
• Numbers k such that phi(sigma(k)+k) = sigma(k).at n=18A068366
• Total number of parts in all compositions of n into relatively prime parts.at n=12A085411
• a(n) = 7*2^n - 1.at n=12A086224
• a(n) = 1024*n - 1.at n=27A158421
• a(n) = 28*n^2 - 1.at n=31A158554
• Numbers of the form i*8^j-1 (i=1..7, j >= 0).at n=34A165804
• Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=41A186393
• a(n) = 7*4^n-1.at n=6A198694
• a(n) = 7*8^n - 1.at n=4A198855
• Smallest m such that A199238(m) = n.at n=13A199262
• Number of (n+2) X 5 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=19A204749
• Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=49A225385