The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A092697

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

A092697

For 1 <= n <= 9, a(n) = least number m such that the product n*m is obtained merely by shifting the rightmost digit of m to the left end (a finite sequence).
(history; published version)

#31 by Joerg Arndt at Fri Dec 23 07:38:00 EST 2022

STATUS

proposed

approved

#30 by Michel Marcus at Fri Dec 23 02:13:14 EST 2022

STATUS

editing

proposed

#29 by Michel Marcus at Fri Dec 23 02:13:10 EST 2022

EXTENSIONS

a(9) added by _Ian Duff, _, Jan 03 2012

STATUS

approved

editing

#28 by Giovanni Resta at Tue Feb 18 17:11:29 EST 2020

STATUS

reviewed

approved

#27 by Joerg Arndt at Tue Feb 18 11:37:10 EST 2020

STATUS

proposed

reviewed

#26 by Michel Marcus at Tue Feb 18 11:24:29 EST 2020

STATUS

editing

proposed

#25 by Michel Marcus at Tue Feb 18 11:24:24 EST 2020

EXAMPLE

For n=5: 142857*5=714285 . [From Dzmitry Paulenka (pavlenko(AT)tut.by), Aug 09 2009]

STATUS

proposed

editing

#24 by Alois P. Heinz at Tue Feb 18 11:16:11 EST 2020

STATUS

editing

proposed

#23 by Alois P. Heinz at Tue Feb 18 11:15:01 EST 2020

FORMULA

a(n) = n(10^m-1)/(10n-1), where m (=A094224) is the order of 10 modulo 10n-1. - Moses Liskov (mliskov(AT)cs.wm.edu), May 17 2006

EXTENSIONS

Incorrect formula removed by Alois P. Heinz, Feb 18 2020

STATUS

approved

editing

Discussion

Tue Feb 18

11:15

Alois P. Heinz: See history and recent changes to A094224, ...

#22 by N. J. A. Sloane at Wed Apr 10 22:18:13 EDT 2019

STATUS

editing

approved