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.

A088150 Value of n-th digit (counting from the right) in binary representation of n^n.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1
Offset: 0

Views

Author

Reinhard Zumkeller, Sep 20 2003

Keywords

Comments

a(n)=d(n) with n^n = Sum(d(k)*2^k: 0<=d(k)<2, k>=0).

Examples

			n=5, 5^5=3125 -> '110000110101', '1100001-----': a(5)=1.
		

Crossrefs

Programs

  • Mathematica
    Join[{1,0},Table[IntegerDigits[n^n,2][[-n-1]],{n,2,110}]] (* Harvey P. Dale, Oct 14 2021 *)

Formula

a(n) = floor(n^n / 2^n) mod 2.

Extensions

Definition clarified by Harvey P. Dale, Oct 14 2021