login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331271 a(n) is the greatest divisor v of A331221(n) such that the decimal representations of v and of A331221(n)/v have the same number of digits d for d = 0..9. 3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 21, 16, 17, 18, 19, 20, 31, 21, 22, 23, 41, 24, 25, 26, 27, 32, 51, 28, 29, 30, 31, 61, 42, 32, 33, 34, 71, 35, 36, 52, 37, 38, 81, 43, 39, 40, 62, 41, 91, 42, 43, 53, 44, 72, 45, 46, 47, 63, 82, 48, 49, 54 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

FORMULA

a(n) * A331270(n) = A331221(n).

PROG

(PARI) b=10; k=67; for (n=1, oo, fordiv (n, u, if (vecsort(digits(u, b))==vecsort(digits(v=n/u, b)), print1 (v", "); break (if (k--, 1, 2)))))

CROSSREFS

Cf. A331221, A331270.

Sequence in context: A052060 A084688 A194898 * A267016 A023769 A023796

Adjacent sequences: A331268 A331269 A331270 * A331272 A331273 A331274

KEYWORD

nonn,base

AUTHOR

Rémy Sigrist, Jan 13 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 08:20 EST 2022. Contains 358458 sequences. (Running on oeis4.)