login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335001 Integers m such that d(F(m)) = d(L(m)) where d is the number of divisors function, F(n) and L(n) are respectively the n-th Fibonacci and n-th Lucas numbers. 2
1, 4, 5, 7, 10, 11, 13, 14, 17, 18, 26, 46, 47, 58, 73, 77, 85, 89, 103, 107, 121, 139, 167, 179, 181, 187, 205, 221, 233, 241, 247, 253, 257, 262, 269, 273, 281, 293, 295, 317, 329, 335, 337, 341, 371, 377, 397, 407, 409, 427, 442, 454, 466, 491, 506, 563, 611 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers m such that A063375(m) = A272377(m).
It appears that this is a subsequence of A335001, so that terms also satisfy omega(F(m)) = omega(L(m))
LINKS
PROG
(PARI) lucas(n) = fibonacci(n+1)+fibonacci(n-1);
isok(m) = numdiv(fibonacci(m))==numdiv(lucas(m));
CROSSREFS
Sequence in context: A278335 A243300 A231575 * A368659 A153085 A047259
KEYWORD
nonn
AUTHOR
Michel Marcus, May 19 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)