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.

Showing 1-3 of 3 results.

A138141 Numbers with digits in ascending order that differ exactly by 1.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456, 4567, 5678, 6789, 12345, 23456, 34567, 45678, 56789, 123456, 234567, 345678, 456789, 1234567, 2345678, 3456789, 12345678, 23456789, 123456789
Offset: 1

Views

Author

Omar E. Pol, Mar 19 2008

Keywords

Comments

This finite sequence has 45 members. The last member is 123456789. There are 10-k members with k digits. See A052017 for primes in this sequence. All members with 3 or more digits are straight-line numbers A135643.

Crossrefs

Programs

  • Mathematica
    Table[FromDigits/@Partition[Range[9],n,1],{n,9}]//Flatten (* Harvey P. Dale, Mar 19 2017 *)

Formula

a(n) = floor(((9*t^2 - 189*t + 18*n + 182) * (10^t - 1) - 18*t) / 162), where t = floor((21 - sqrt(369 - 8*n)) / 2). - Christopher J. Thomas, Feb 14 2024

A052016 Primes with digits in descending order that differ exactly by 1.

Original entry on oeis.org

2, 3, 5, 7, 43, 76543
Offset: 1

Views

Author

Patrick De Geest, Nov 15 1999

Keywords

Comments

Primes in A138142. - Omar E. Pol, Dec 07 2008

Crossrefs

Programs

  • Mathematica
    fQ[n_]:=Module[{id=IntegerDigits[n],}, n < 10 || Union[Differences[id]] == {-1}]; Select[Prime[Range[10000]], fQ] (* Vladimir Joseph Stephan Orlovsky, Dec 29 2010 *)

A178356 Fibonacci numbers whose successive digits decrease by 1.

Original entry on oeis.org

0, 1, 2, 3, 5, 8, 21, 987
Offset: 1

Views

Author

Felix Tubiana, May 25 2010

Keywords

Comments

Only need to consider the Fibonacci numbers less than 9876543210.

Crossrefs

Programs

  • Mathematica
    Join[{0,1,2,3,5,8},Select[Fibonacci[Range[250]],Union[Differences[ IntegerDigits[#]]]=={-1}&]] (* Harvey P. Dale, Sep 14 2011 *)
  • PARI
    n=0;while((f=fibonacci(n))<=9876543210,if(is(f),print1(f", "));n++) \\ Charles R Greathouse IV, Sep 14 2011

Formula

{ A000045 } intersect { A138142 }. - Alois P. Heinz, Jul 05 2022

Extensions

Definition clarified by Harvey P. Dale, Sep 14 2011
Showing 1-3 of 3 results.