The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A334620

a(n) is the smallest multiple of n formed by the concatenation 1,2,3,...,k for some k.
(history; published version)

#43 by Harvey P. Dale at Mon Apr 04 08:56:48 EDT 2022

STATUS

editing

approved

#42 by Harvey P. Dale at Mon Apr 04 08:56:46 EDT 2022

MATHEMATICA

smn[n_]:=Module[{k=1, c=1}, While[!Divisible[c, n], k++; c= c*10^IntegerLength[ k]+ k]; c]; Array[ smn, 1220] (* Harvey P. Dale, Apr 04 2022 *)

STATUS

approved

editing

#41 by Harvey P. Dale at Mon Apr 04 08:55:49 EDT 2022

STATUS

editing

approved

#40 by Harvey P. Dale at Mon Apr 04 08:55:46 EDT 2022

MATHEMATICA

smn[n_]:=Module[{k=1, c=1}, While[!Divisible[c, n], k++; c= c*10^IntegerLength[ k]+ k]; c]; Array[ smn, 12] (* Harvey P. Dale, Apr 04 2022 *)

STATUS

approved

editing

#39 by Harvey P. Dale at Mon Apr 04 08:55:26 EDT 2022

STATUS

editing

approved

#38 by Harvey P. Dale at Mon Apr 04 08:55:22 EDT 2022

MATHEMATICA

smn[n_]:=Module[{k=1, c=1}, While[!Divisible[c, n], k++; c= c*10^IntegerLength[k]+ k]; c]; Array[ smn, 12] (* Harvey P. Dale, Apr 04 2022 *)

#37 by Harvey P. Dale at Mon Apr 04 08:54:47 EDT 2022

MATHEMATICA

smn[n_]:=Module[{k=1, c=1}, While[!Divisible[c, n], k++; c=c*10^IntegerLength[k]+k]; c]; Array[smn, 12] (* Harvey P. Dale, Apr 04 2022 *)

STATUS

approved

editing

#36 by Michel Marcus at Sun Oct 25 02:51:39 EDT 2020

STATUS

reviewed

approved

#35 by Joerg Arndt at Sun Oct 25 01:37:42 EDT 2020

STATUS

proposed

reviewed

#34 by Robert Israel at Sun Oct 25 00:54:46 EDT 2020

STATUS

editing

proposed