[go: up one dir, main page]

login
A335002
Integers m such that omega(F(m)) = omega(L(m)) where omega is the number of distinct prime divisors function, F(n) and L(n) are the n-th Fibonacci and n-th Lucas numbers.
2
1, 3, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 18, 21, 26, 33, 42, 46, 47, 55, 58, 66, 69, 73, 77, 85, 89, 93, 102, 103, 107, 111, 117, 121, 123, 132, 139, 167, 171, 177, 179, 181, 187, 201, 205, 207, 213, 219, 221, 233, 241, 246, 247, 253, 257, 262, 267, 269, 273, 279, 281, 282, 293, 295
OFFSET
1,2
COMMENTS
Numbers m such that A022307(m) = A086598(m).
PROG
(PARI) lucas(n) = fibonacci(n+1)+fibonacci(n-1);
isok(m) = omega(fibonacci(m))==omega(lucas(m));
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Marcus, May 19 2020
STATUS
approved