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-2 of 2 results.

A307861 Numbers that set records on longest chains of "Chained Divisors" of A306661 and A307858.

Original entry on oeis.org

1, 11, 121, 1111, 12221, 134431, 1234321, 1478741, 1600951, 17610461, 161696051, 193715071, 1634570971
Offset: 1

Views

Author

Giorgos Kalogeropoulos, May 05 2019

Keywords

Comments

Here are the divisor chains:
Length---m----------Divisors
1 1 {1}
2 11 {1,11}
3 121 {1,11,121}
4 1111 {1,11,101,1111}
6 12221 {1,11,101,121,1111,12221}
8 134431 {1,11,101,121,1111,1331,12221,134431}
9 1234321 {1,11,101,121,1111,10201,12221,112211,1234321}
10 1478741 {1,11,101,121,1111,1331,12221,14641,134431,1478741}
The longest chain known is of number 1634570971 of length 24.
Under the assumption that all divisors begin and end with 1, the next terms are 19565222171, 153203879191, 165091668071, 197783087491, and 1685242671101, with 30, 32, 36, 40, and 48 divisors, respectively. - Charlie Neder, May 08 2019

Crossrefs

Programs

  • PARI
    { mx=0; for (n=1, oo, if (#(d=divisors(n))>mx, ok=1; d=apply(digits,d); for (i=1, #d-1, if (d[i][#d[i]]!=d[i+1][1], ok=0; break)); if (ok,
    print1 (n ", "); mx=#d))) } \\ Rémy Sigrist, May 06 2019

Extensions

a(11)-a(13) from Rémy Sigrist, May 06 2019

A307858 Composite numbers k with its divisors having the property that the last digit of every divisor is the same as the first digit of the next divisor.

Original entry on oeis.org

121, 1111, 1207, 1331, 1441, 1661, 1991, 10201, 11231, 11341, 11561, 11671, 11917, 12001, 12221, 12661, 12767, 12881, 12937, 12991, 13211, 13231, 13541, 14201, 14311, 14531, 14641, 14971, 15191, 15251, 15851, 15961, 16181, 16291, 16621, 16841, 17161, 17281, 17309, 17611
Offset: 1

Views

Author

Giorgos Kalogeropoulos, May 05 2019

Keywords

Examples

			97663 is in the sequence because it is composite and its divisors, 1, 127, 769, 97663 have the property that the last digit of every divisor is the first digit of the next one.
		

Crossrefs

A306661 contains all these numbers plus prime numbers starting with 1.

Programs

  • Mathematica
    Select[Range@20000,PrimeQ@#==False&&And@@(Last@#[[1]]==First@#[[2]]&/@Partition[IntegerDigits/@Divisors@#,2,1])&]
Showing 1-2 of 2 results.