cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Original entry on oeis.org

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
Offset: 1

Views

Author

Michel Marcus, May 19 2020

Keywords

Comments

Numbers m such that A063375(m) = A272377(m).
It appears that this is a subsequence of A335002, so that terms also satisfy omega(F(m)) = omega(L(m))

Crossrefs

Programs

  • PARI
    lucas(n) = fibonacci(n+1)+fibonacci(n-1);
    isok(m) = numdiv(fibonacci(m))==numdiv(lucas(m));