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.

Showing 1-1 of 1 results.

A350690 Numbers k that divide the sum of divisors of Fibonacci(k).

Original entry on oeis.org

1, 3, 4, 7, 8, 9, 13, 14, 16, 17, 18, 19, 21, 23, 24, 26, 27, 28, 30, 31, 32, 34, 36, 37, 38, 39, 42, 43, 44, 46, 47, 48, 49, 51, 52, 53, 54, 56, 57, 59, 61, 62, 63, 64, 67, 68, 69, 70, 71, 72, 73, 74, 76, 78, 79, 81, 83, 84, 86, 87, 88, 90, 91, 92, 93, 94, 96
Offset: 1

Views

Author

Amiram Eldar, Jan 12 2022

Keywords

Comments

This sequence is infinite (Luca, 2002).

Examples

			3 is a term since 3 divides sigma(Fibonacci(3)) = sigma(2) = 3.
4 is a term since 4 divides sigma(Fibonacci(4)) = sigma(3) = 4.
		

Crossrefs

Similar sequences: A074698, A075775.

Programs

  • Mathematica
    Select[Range[100], Divisible[DivisorSigma[1, Fibonacci[#]], #] &]
  • Python
    from sympy import divisor_sigma, fibonacci
    print([k for k in range(1, 97) if divisor_sigma(fibonacci(k)) % k == 0])
    # Karl-Heinz Hofmann, Jan 12 2022
Showing 1-1 of 1 results.