[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A062996 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A062996 Sum of digits is greater than or equal to product of digits.
(history; published version)
#11 by Harvey P. Dale at Wed Sep 27 12:49:02 EDT 2023
STATUS

editing

approved

#10 by Harvey P. Dale at Wed Sep 27 12:49:00 EDT 2023
MATHEMATICA

Select[Range[150], Total[IntegerDigits[#]]>=Times@@IntegerDigits[#]&] (* Harvey P. Dale, Sep 27 2023 *)

STATUS

approved

editing

#9 by Bruno Berselli at Thu Jun 28 04:47:45 EDT 2018
STATUS

reviewed

approved

#8 by Joerg Arndt at Thu Jun 28 04:21:15 EDT 2018
STATUS

proposed

reviewed

#7 by Jon E. Schoenfield at Thu Jun 28 00:55:39 EDT 2018
STATUS

editing

proposed

#6 by Jon E. Schoenfield at Thu Jun 28 00:55:36 EDT 2018
LINKS

Harry J. Smith, <a href="/A062996/b062996.txt">Table of n, a(n) for n= = 1,...,..1000</a>

PROG

(PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } ProdD(x)= { p=1; while (x>9, p*=(x-10*(x\10)); x\=10); return(p*x) } { n=0; for (a=1, 10^9, if (SumD(a) >= ProdD(a), write("b062996.txt", n++, " ", a); if (n==1000, break)) ) } [From _)) ) } \\ _Harry J. Smith_, Aug 15 2009]

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:51:34 EDT 2012
AUTHOR

_Henry Bottomley (se16(AT)btinternet.com), _, Jun 29 2001

Discussion
Fri Mar 30 18:51
OEIS Server: https://oeis.org/edit/global/247
#4 by Russ Cox at Fri Mar 30 17:24:21 EDT 2012
PROG

(PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } ProdD(x)= { p=1; while (x>9, p*=(x-10*(x\10)); x\=10); return(p*x) } { n=0; for (a=1, 10^9, if (SumD(a) >= ProdD(a), write("b062996.txt", n++, " ", a); if (n==1000, break)) ) } [From _Harry J. Smith (hjsmithh(AT)sbcglobal.net), _, Aug 15 2009]

Discussion
Fri Mar 30 17:24
OEIS Server: https://oeis.org/edit/global/133
#3 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

Harry J. Smith, <a href="="/A062996/b062996.txt">Table of n, a(n) for n=1,...,1000</a>

KEYWORD

base,nonn,new

#2 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
LINKS

Harry J. Smith, <a href="b062996.txt">Table of n, a(n) for n=1,...,1000</a>

PROG

(PARI) SumD(x)= { s=0; while (x>9, s+=x-10*(x\10); x\=10); return(s + x) } ProdD(x)= { p=1; while (x>9, p*=(x-10*(x\10)); x\=10); return(p*x) } { n=0; for (a=1, 10^9, if (SumD(a) >= ProdD(a), write("b062996.txt", n++, " ", a); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 15 2009]

KEYWORD

base,nonn,new

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:09 EDT 2024. Contains 375511 sequences. (Running on oeis4.)