[go: up one dir, main page]

login
Revision History for A257679 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
The smallest nonzero digit present in the factorial base representation (A007623) of n, 0 if no nonzero digits present.
(history; published version)
#38 by Joerg Arndt at Wed Jan 24 01:49:46 EST 2024
STATUS

reviewed

approved

#37 by Michel Marcus at Wed Jan 24 01:05:49 EST 2024
STATUS

proposed

reviewed

#36 by Amiram Eldar at Wed Jan 24 00:10:31 EST 2024
STATUS

editing

proposed

#35 by Amiram Eldar at Tue Jan 23 23:54:13 EST 2024
MATHEMATICA

a[n_] := Module[{k = n, m = 2, rmin = n, r}, While[{k, r} = QuotientRemainder[k, m]; k != 0 || r != 0, If[0 < r < rmin, rmin = r]; m++]; rmin]; Array[a, 100, 0] (* Amiram Eldar, Jan 23 2024 *)

STATUS

approved

editing

#34 by Peter Luschny at Sat Mar 13 12:43:30 EST 2021
STATUS

reviewed

approved

#33 by Michel Marcus at Sat Mar 13 12:12:26 EST 2021
STATUS

proposed

reviewed

#32 by F. Chapoton at Sat Mar 13 11:44:33 EST 2021
STATUS

editing

proposed

#31 by F. Chapoton at Sat Mar 13 11:44:25 EST 2021
PROG

def A(n, p=2):

def A(n, p=2): return n if n<p else A(int(n//p), , p+1)*10 + n%p

def a(n):

def a(n): return 0 if n==0 else min([int(i) for i in str(A(n)) if i !='0'])

print ([a(n) for n in range(201)] ) # Indranil Ghosh, Jun 19 2017

STATUS

approved

editing

Discussion
Sat Mar 13
11:44
F. Chapoton: adapt py code to py3
#30 by N. J. A. Sloane at Sat Dec 07 12:18:27 EST 2019
PROG

print [a(n) for n in xrangerange(201)] # Indranil Ghosh, Jun 19 2017

Discussion
Sat Dec 07
12:18
OEIS Server: https://oeis.org/edit/global/2837
#29 by Bruno Berselli at Mon Jun 19 04:39:05 EDT 2017
STATUS

proposed

approved