23688

Appears in sequences

• Fibonacci sequence beginning 0, 24.at n=16A022358
• T(n,n-3), array T given by A047010.at n=8A047015
• Numbers k such that sigma(x) = k has exactly 10 solutions.at n=32A060666
• Nearest integer to arithmetic mean of n! and n^n.at n=6A062873
• Integer part of arithmetic mean of n! and n^n.at n=6A062874
• Composite numbers k such that k - phi(k) divides sigma(k) - k.at n=14A068418
• Composite n such that n reduced mod(phi(n)) = sigma(n) reduced mod(n).at n=13A068495
• Integer quotient defining A068418 is 3.at n=6A069737
• a(n) is the difference between the largest and smallest integer solutions to n=x/pi(x), where pi(x) = A000720(x).at n=34A087236
• Number of rooted 2-dimensional polyominoes with n octagonal cells, with no symmetries removed.at n=5A094169
• a(n) = A000203(n) * A024916(n).at n=25A143238
• a(n) = 121*n^2 - 2*n.at n=13A157040
• Averages of twin prime pairs that are sums of 4 consecutive averages of twin prime pairs.at n=21A160918
• n!, digits ordered, zeros omitted.at n=9A181952
• n!, digits ordered, zeros omitted.at n=10A181952
• Coefficient of x in the reduction of the polynomial p(n,x) defined at A162517 and below in Comments.at n=8A192374
• a(n) = Fibonacci(n)*A000118(n) for n>=1 with a(0)=1, where A000118(n) is the number of ways of writing n as a sum of 4 squares.at n=16A205963
• Numbers that are a product of distinct Fibonacci numbers (A160009) and also a product of distinct Lucas numbers (A274280).at n=7A273803
• Numbers that are a product of distinct Fibonacci numbers (A000045) and also a product of distinct Lucas numbers (A000032, including 2).at n=19A274371
• Least number k such that the determinant of the symmetric Toeplitz matrix formed by its decimal digits is equal to n.at n=46A307887