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.

A376454 n in base whose place values are a modified ternary sequence; see Comments.

Original entry on oeis.org

0, 1, 10, 100, 101, 110, 200, 201, 210, 1000, 1001, 1010, 1100, 1101, 1110, 1200, 1201, 1210, 2000, 2001, 2010, 2100, 2101, 2110, 2200, 2201, 2210, 10000, 10001, 10010, 10100, 10101, 10110, 10200, 10201, 10210, 11000, 11001, 11010, 11100, 11101, 11110, 11200
Offset: 0

Views

Author

Clark Kimberling, Sep 28 2024

Keywords

Comments

The modified ternary sequence, (1,2,3,9,27,81,...) consists of 2 together with all 3^k for k>=0.

Examples

			8 = 2*3 + 1*2 + 0*1, so that 8 in the modified ternary base is 210.
		

Crossrefs

Programs

  • Mathematica
    greedy[list_, n_] := Reap[FoldList[(Sow[Quotient[#1, #2]]; Mod[#1, #2]) &, n, Reverse[list]]][[2, 1]];
    seq = Insert[Table[3^n, {n, 0, 5}], 2, 2]; (*1,2,3,9,27,...*)
    Table[FromDigits[greedy[seq, n]], {n, Last[seq]}]
    (* Peter J. C. Moses, Oct 18 2012; from A214973 *)