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.

A256825 Numbers with digits in strictly decreasing order containing digit 1.

Original entry on oeis.org

1, 10, 21, 31, 41, 51, 61, 71, 81, 91, 210, 310, 321, 410, 421, 431, 510, 521, 531, 541, 610, 621, 631, 641, 651, 710, 721, 731, 741, 751, 761, 810, 821, 831, 841, 851, 861, 871, 910, 921, 931, 941, 951, 961, 971, 981, 3210, 4210, 4310, 4321, 5210, 5310, 5321
Offset: 1

Views

Author

Jaroslav Krizek, Apr 10 2015

Keywords

Comments

a(n) = possible values of A256824(m) in increasing order where A256824(m) = reverse concatenation of distinct digits of all divisors of m in base 10.
There are precisely 512 terms. Maximal term is 9876543210.
Subsequence of A009995 (numbers with digits in strictly decreasing order).
See A256826 - the smallest number k such that A256824(k) = a(n).

Examples

			21 is in sequence because there are numbers m such that A256824(m) = 21 (for m = 2, 22, 121, 211, 2111, ...).
		

Crossrefs

Programs

  • Excel
    [Row n = 1 … 1023; Column A: A(n) = A009995(n); Column B: B(n) =  =IF(FIND("1";A(n);1)>0;A(n)); Arrangement of column B]
    
  • PARI
    lista(nn) = for (n=1, nn, if ((d = digits(n)) && ((sd=vecsort(d,,8))==Vecrev(d)) && vecsearch(sd, 1), print1(n, ", "))); \\ Michel Marcus, Apr 11 2015