The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A301382 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A301382

a(1) = 1. For n > 1, a(n) is the smallest positive integer x not already in the sequence such that the product of x and its initial digit is minimal and strictly larger than the same product for any previous term.
(history; published version)

#14 by OEIS Server at Fri Mar 23 01:58:49 EDT 2018

LINKS

Jean-Marc Falcoz, <a href="/A301382/b301382_1.txt">Table of n, a(n) for n = 1..10000</a>

#13 by N. J. A. Sloane at Fri Mar 23 01:58:49 EDT 2018

STATUS

proposed

approved

Discussion

Fri Mar 23

01:58

OEIS Server: Installed new b-file as b301382.txt.  Old b-file is now b301382_1.txt.

#12 by Rémy Sigrist at Thu Mar 22 13:38:57 EDT 2018

STATUS

editing

proposed

#11 by Rémy Sigrist at Thu Mar 22 13:37:50 EDT 2018

NAME

a(1) = 1. For n > 1, a(n) is the smallest positive integer x not already in the sequence such that the product of x and its initial digit is minimal and strictly larger than the same product for any previous term.

STATUS

proposed

editing

Discussion

Thu Mar 22

13:38

Rémy Sigrist: added "minimal" in the name

#10 by Rémy Sigrist at Thu Mar 22 13:19:10 EDT 2018

STATUS

editing

proposed

#9 by Rémy Sigrist at Thu Mar 22 13:17:34 EDT 2018

PROG

(PARI) p = vector(136, k, oo); for (n=1, #p, x = n*digits(n)[1]; if (x<=#p, p[x] = min(p[x], n))); for (k=1, #p, if (p[k] != oo, print1 (p[k] ", "))) \\ Rémy Sigrist, Mar 22 2018

STATUS

proposed

editing

#8 by Felix Fröhlich at Tue Mar 20 15:53:12 EDT 2018

STATUS

editing

proposed

Discussion

Tue Mar 20

16:21

Eric Angelini: Hello Felix -- great ! Now I understand clearly what this is all about -- merci beaucoup !

Thu Mar 22

07:49

Michel Marcus: Also can you add a program (see https://oeis.org/wiki/Style_Sheet#Maple or following sections Mathematica or Programs) also in other sequences that you submit

09:40

Eric Angelini: Hello Michel, I don't work like this, I'm sorry -- as I don't even know how the "Basic for Dummies" works (I'm not proud at all for that). I work with paper and pencil -- then ask for help to friends of mine who suggest improvements and sometimes new ideas. They know very often how to write a computer program - but are sometimes not related to the OEIS themselves.

#7 by Felix Fröhlich at Tue Mar 20 15:49:54 EDT 2018

NAME

Smallest a(1) = 1. For n > 1, a(n) is the smallest positive integer x not already in the sequence such that the product P = [a(n)*first of x and its initial digit of a(n)] is the smallest one strictly bigger larger than the same product for any previous one, with a(1) = 1 and no duplicate termsterm.

STATUS

proposed

editing

Discussion

Tue Mar 20

15:52

Felix Fröhlich: I formulated a definition from the previous name, terms and example. I hope this matches what is intended. Please check my changes and let me know if anything needs to be fixed.

#6 by Eric Angelini at Tue Mar 20 10:20:45 EDT 2018

STATUS

editing

proposed

Discussion

Tue Mar 20

10:31

Michel Marcus: do not worry

12:36

Omar E. Pol: Not sure about the title since a(n) is the n-th term of the sequence.

13:01

Eric Angelini: I don't know what to say, Omar. I've sent this exact definition to my co-publisher (in French), he got the idea in seconds and computed immediately the b-file. I have to admit that writing sound definitions in English is a nightmare for me -- could you (or someone else) improve it? If not, cancel this sequence and recycle its A-number, nobody will be hurt!

#5 by Eric Angelini at Tue Mar 20 10:19:44 EDT 2018

LINKS

Jean-Marc Falcoz, <a href="/A301382/b301382_1.txt">Table of n, a(n) for n = 1..999910000</a>

STATUS

proposed

editing