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.

A320487 a(0) = 1; thereafter a(n) is obtained by applying the "delete multiple digits" map m -> A320485(m) to 2*a(n-1).

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 3, 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, 61, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 3, 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, 61, 1
Offset: 0

Views

Author

N. J. A. Sloane, Oct 24 2018, following a suggestion from Eric Angelini

Keywords

Comments

In short, double the previous term and delete any digits appearing more than once.
Periodic with period 28.
Using the variant A320486 yields the same sequence, since the empty string never occurs. - M. F. Hasler, Oct 24 2018
Conjecture: If we start with any nonnegative integer and repeatedly double and apply the "delete multiple digits" map m -> A320485(m), we eventually reach 0 or 1 (see A323835). - N. J. A. Sloane, Feb 03 2019

Examples

			2*32768 = 65536 -> 3 since we delete the multiple digits 6 and 5.
2*61 = 122 -> 1 since we delete the multiple 2's.
		

References

  • Eric Angelini, Posting to Sequence Fans Mailing List, Oct 24 2018

Crossrefs

See A035615 for a classic related base-2 sequence.

Programs

  • Mathematica
    a[0] = 1;a[n_] := a[n] = FromDigits[First /@ Select[ Tally[IntegerDigits[2 a[n - 1]]], #[[2]] == 1 &]];Table[a[n], {n, 0, 56}] (* Stan Wagon, Nov 17 2018 *)
  • PARI
    A=[2];for(i=1,99,A=concat(A,A320486(A[#A]*2)));A \\ M. F. Hasler, Oct 24 2018