356400

Appears in sequences

• Composite n added to sum of its prime factors is nextprime(n).at n=5A050765
• Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-pattern is equal to k.at n=50A092583
• Triangle T(n, k) = n*( (n-1)! - (k-1)! ), read by rows.at n=42A137259
• Molecular topological indices of the lattice graphs.at n=9A192832
• a(n) = A203309(n+1)/A203309(n).at n=5A203310
• Numbers m such that, in the prime factorization of m, the product of the exponents equals the sum of prime factors and exponents.at n=30A231231
• Number of squares that divide 1!*2!*3!*...*n!.at n=14A248784
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=29A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=30A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=31A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=32A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=33A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=34A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=35A299144
• a(n) is the least i such that gcd(Fibonacci(i), i+x) > 1 for all x=0..n.at n=36A299144
• Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose largest connected component has exactly k nodes; n >= 1, 1 <= k <= n.at n=61A348070
• Triangular array read by rows: T(n,k) is the number of undirected 2-regular labeled graphs whose smallest connected component has exactly k nodes; n >= 1, 1 <= k <= n.at n=58A348071