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.

A056009 a(n) = (n^n + 1)/ (n^(2^a) + 1), where 2^a is the highest power of 2 dividing n.

Original entry on oeis.org

1, 1, 7, 1, 521, 1261, 102943, 1, 38742049, 99009901, 23775972551, 429960961, 21633936185161, 56406126018061, 27368368148803711, 1, 45957792327018709121, 121065871000912423309, 98920982783015679456199
Offset: 1

Views

Author

Leroy Quet, Jul 24 2000

Keywords

Examples

			The sixth term is (6^6 + 1)/ (6^(2^1) + 1) = 1261, since 2^1 is highest power of 2 dividing 6.
		

Programs

  • Mathematica
    Array[(#^# + 1)/(#^(2^IntegerExponent[#, 2]) + 1) &, 19] (* Michael De Vlieger, Dec 11 2017 *)