109441

Properties

Appears in sequences

• Smallest primitive prime factor of Fibonacci number F(n), or 1 if F(n) has no primitive prime factor.at n=44A001578
• Largest prime factor of n-th Fibonacci number.at n=42A060385
• Primitive part of Fibonacci(n).at n=44A061446
• Factorize the Fibonacci numbers in order, skipping F(0)-F(2), F(6)=8 and F(12)=144; at each step at least one new prime will occur; append to the sequence the smallest such new prime.at n=40A061488
• Class 8+ primes.at n=1A081636
• Largest prime divisor of Fibonacci(5n).at n=8A121170
• Largest prime divisor of Fibonacci(5n).at n=17A121170
• Prime numbers that are Fibonacci integers.at n=37A178762
• Product of primitive prime factors of Fibonacci(n).at n=44A178763
• Primes of the form 3*m^2 - 2.at n=29A201715
• Number of nX3 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction.at n=3A221871
• Number of nX4 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction.at n=2A221872
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction.at n=17A221873
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without consecutive moves in the same direction.at n=18A221873
• Largest primitive prime factor of Fibonacci number F(n), or 1 if no primitive.at n=44A262341
• Primes p such that p+12, (p+1)/2, and (p+13)/2 are also prime.at n=30A283869
• Numbers k such that k + 6^t is semiprime for t = 0 to 9.at n=1A330508
• Primes using all the square digits {0, 1, 4, 9} and no others.at n=27A331346
• Number of chiral pairs of polyominoes with n heptagonal cells of the hyperbolic regular tiling with Schläfli symbol {7,oo}.at n=4A389562
• Prime numbersat n=10404