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.

Previous Showing 31-34 of 34 results.

A337184 Numbers divisible by their first digit and their last digit.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22, 24, 33, 36, 44, 48, 55, 66, 77, 88, 99, 101, 102, 104, 105, 111, 112, 115, 121, 122, 123, 124, 125, 126, 128, 131, 132, 135, 141, 142, 144, 145, 147, 151, 152, 153, 155, 156, 161, 162, 164, 165, 168, 171, 172, 175, 181, 182
Offset: 1

Views

Author

Bernard Schott, Jan 29 2021

Keywords

Comments

The first 23 terms are the same first 23 terms of A034838 then a(24) = 101 while A034838(24) = 111.
Terms of A034709 beginning with 1 and terms of A034837 ending with 1 are terms.
All positive repdigits (A010785) are terms.
There are infinitely many terms m for any of the 53 pairs (first digit, last digit) of m described below: when m begins with {1, 3, 7, 9} then m ends with any digit from 1 to 9; when m begins with {2, 4, 6, 8}, then m must also end with {2, 4, 6, 8}; to finish, when m begins with 5, m must only end with 5. - Metin Sariyar, Jan 29 2021

Crossrefs

Intersection of A034709 and A034837.
Subsequences: A010785\{0}, A034838, A043037, A043040, A208259, A066622.
Cf. A139138.

Programs

  • Mathematica
    Select[Range[175], Mod[#, 10] > 0 && And @@ Divisible[#, IntegerDigits[#][[{1, -1}]]] &] (* Amiram Eldar, Jan 29 2021 *)
  • PARI
    is(n) = n%10>0 && n%(n%10)==0 && n % (n\10^logint(n,10)) == 0 \\ David A. Corneth, Jan 29 2021
  • Python
    def ok(n): s = str(n); return s[-1] != '0' and n%int(s[0])+n%int(s[-1]) == 0
    print([m for m in range(180) if ok(m)]) # Michael S. Branicky, Jan 29 2021
    

Formula

(10n-9)/9 <= a(n) < 45n. (I believe the liminf of a(n)/n is 3.18... and the limsup is 6.18....) - Charles R Greathouse IV, Nov 26 2024
Conjecture: 3n < a(n) < 7n for n > 75. - Charles R Greathouse IV, Dec 02 2024

A116957 Lynch-Bell numbers n such that 5 is a digit of n.

Original entry on oeis.org

5, 15, 135, 175, 315, 735, 1395, 1935, 3195, 3915, 9135, 9315
Offset: 1

Views

Author

Walter Kehowski, Apr 03 2006

Keywords

Comments

A Lynch-Bell number is a positive integer n with distinct nonzero digits such that each of its digits divides the number: n mod d = 0 if d is a digit of n.

Examples

			a(3)=135 since 135 is the third Lynch-Bell number that contains a 5.
		

Crossrefs

Programs

  • Mathematica
    lbn5Q[n_]:=Module[{idn=IntegerDigits[n]},MemberQ[idn,5]&&FreeQ[idn,0]&&Max[DigitCount[n]]==1&&AllTrue[n/idn,IntegerQ]]; Select[Range[ 10000],lbn5Q] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Aug 19 2019 *)

A116960 Lynch-Bell numbers k such that 1 is not a digit of k.

Original entry on oeis.org

2, 3, 4, 5, 6, 7, 8, 9, 24, 36, 48, 248, 264, 324, 384, 396, 432, 624, 648, 672, 728, 735, 784, 824, 864, 936, 2364, 2436, 3264, 3276, 3492, 3624, 3648, 3864, 3924, 4236, 4368, 4392, 4632, 4872, 4896, 4932, 4968, 6324, 6384, 6432, 6984, 8496, 8736, 9324, 9432
Offset: 1

Views

Author

Walter Kehowski, Apr 03 2006

Keywords

Comments

The Lynch-Bell numbers are those positive integers k with distinct nonzero digits such that each digit divides k: k mod d = 0 if d is a digit of k.

Examples

			a(9)=24 since it is the 9th Lynch-Bell number that does not contain a 1.
		

Crossrefs

A261448 Numbers n >= 100 that are divisible by n mod 100.

Original entry on oeis.org

101, 102, 104, 105, 110, 120, 125, 150, 201, 202, 204, 205, 208, 210, 220, 225, 240, 250, 301, 302, 303, 304, 305, 306, 310, 312, 315, 320, 325, 330, 350, 360, 375, 401, 402, 404, 405, 408, 410, 416, 420, 425, 440, 450, 480, 501, 502, 504, 505, 510, 520, 525, 550
Offset: 1

Views

Author

Giovanni Teofilatto, Aug 19 2015

Keywords

Comments

This sequence can be seen as the union of 99 linear sequences of the form a_i*k+i, for i=1,...,99 and k>0, where a_i depends on i. For example, 100*k+1, 100*k+2, 300*k+3,..., 4700*k+94, 1900*k+95,..., 9900*k+99. Hence, in analogy with A034709, there exist two numbers p and q such that a(p*k+i) = q*k + a(i), where q <= lcm(1,2,...,99). - Giovanni Resta, Aug 20 2015

Crossrefs

Programs

  • Mathematica
    Select[Range[100, 1000], Quiet@ Divisible[#, Mod[#, 100]] &] (* Giovanni Resta, Aug 19 2015 *)
  • PARI
    isok(n) = (n>100) && (dd = n % 100) && !(n % dd); \\ Michel Marcus, Aug 19 2015

Extensions

More terms from Michel Marcus, Aug 19 2015
Previous Showing 31-34 of 34 results.