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.

A280689 a(n) = A000045(A032742(n)) / A000045(A054576(n)), where A000045(n) gives the n-th Fibonacci number, A032742(n) = the largest proper divisor of n, and A054576(n) = A032742(A032742(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 3, 2, 5, 1, 4, 1, 13, 5, 7, 1, 17, 1, 11, 13, 89, 1, 18, 5, 233, 17, 29, 1, 122, 1, 47, 89, 1597, 13, 76, 1, 4181, 233, 123, 1, 842, 1, 199, 122, 28657, 1, 322, 13, 15005, 1597, 521, 1, 5777, 89, 843, 4181, 514229, 1, 1364, 1, 1346269, 842, 2207, 233, 39602, 1, 3571, 28657, 709805, 1, 5778, 1, 24157817, 15005, 9349, 89, 271442, 1, 15127, 5777
Offset: 1

Views

Author

Antti Karttunen, Jan 11 2017

Keywords

Comments

A000045 is a divisibility sequence, which guarantees that the result of the division is an integer.

Crossrefs

Programs

Formula

a(n) = A105800(n) / A280688(n) = A105800(n) / A105800(A032742(n)).
a(n) = A000045(A032742(n)) / A000045(A054576(n)).
a(n) = A280690(A032742(n)).
Showing 1-1 of 1 results.