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~~.)
newer changes | Showing entries 11-14

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)

#4 by Eric Angelini at Tue Mar 20 03:45:48 EDT 2018

STATUS

editing

proposed

Discussion

Tue Mar 20

07:14

Michel Marcus: bfile is missing an empty line at the end (so system saw only 9999 terms)

07:15

Michel Marcus: but you did not see last bullet of https://oeis.org/wiki/Style_Sheet#Links ?

10:17

Eric Angelini: I do not know what is a bullet, Michel -- and this is indeed the first time I see the page you are mentioning. Still, I will send the b-file again (though I don't know how to erase the previous one -- I will try). Sorry for the time loss I'm causing (I'm getting depressed).

#3 by Eric Angelini at Tue Mar 20 03:45:12 EDT 2018

NAME

Smallest a(n) such that the product P = [a(n)*first digit of a(n)] is the smallest one strictly bigger than the previous one, with a(1) = 1 and no duplicate terms.

DATA

1, 2, 3, 10, 11, 12, 13, 14, 15, 4, 17, 18, 19, 5, 6, 20, 21, 22, 23, 24, 7, 25, 26, 27, 28, 29, 8, 9, 30, 31, 32, 33, 100, 101, 34, 103, 104, 35, 106, 107, 36, 109, 110, 37, 112, 113, 38, 115, 116, 39, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 40, 161, 162, 163, 41, 165, 166, 167, 42, 169, 170, 171, 43, 173, 174, 175, 44

COMMENTS

We see in the Example section that P is the smallest possible product strictly bigger than the previous one and not leading to a contradiction.

LINKS

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

#2 by Eric Angelini at Tue Mar 20 03:43:44 EDT 2018

NAME

allocated for Eric Angelini Smallest a(n) such that the product P = [a(n)*first digit of a(n)] is the smallest one strictly bigger than the previous one, with a(1) = 1 and no duplicate terms.

DATA

OFFSET

1,2

COMMENTS

We see in the Example section that P is the smallest possible product strictly bigger than the previous one and not leading to a contradiction.

EXAMPLE

a(1) * [the first digit of a(1)] = 1 * 1 = P = 1

a(2) * [the first digit of a(2)] = 2 * 2 = P = 4

a(3) * [the first digit of a(3)] = 3 * 3 = P = 9

a(4) * [the first digit of a(4)] = 10 * 1 = P = 10

a(5) * [the first digit of a(5)] = 11 * 1 = P = 11

a(6) * [the first digit of a(6)] = 12 * 1 = P = 12

a(7) * [the first digit of a(7)] = 13 * 1 = P = 13

a(8) * [the first digit of a(8)] = 14 * 1 = P = 14

a(9) * [the first digit of a(9)] = 15 * 1 = P = 15

a(10) * [the first digit of a(10)] = 4 * 4 = P = 16

a(11) * [the first digit of a(11)] = 17 * 1 = P = 17

Etc.

KEYWORD

allocated

nonn,base

AUTHOR

Eric Angelini and Jean-Marc Falcoz, Mar 20 2018

STATUS

approved

editing

#1 by Eric Angelini at Tue Mar 20 03:43:44 EDT 2018

NAME

allocated for Eric Angelini

KEYWORD

allocated

STATUS

approved