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.

A056154 Numbers n such that the number of times each digit occurs in 2^n, represented in base 3, is the same as 2^(n+1), also represented in base 3. Or in other words, when represented in base 3, the digits in 2^n can be rearranged to form 2^(n+1).

Table of values

n a(n)
1 5
2 27
3 40
4 92
5 138
6 929
7 1086
8 352664
9 4976816
10 9914261
11 23434996
12 30490425
13 49094174

List of values

[5, 27, 40, 92, 138, 929, 1086, 352664, 4976816, 9914261, 23434996, 30490425, 49094174]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.