The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A282342

a(n) is the smallest prime number, with sum of digits equals n and a(n) is greater than previous nonzero terms, except if this is not possible in which case a(n)=0
(history; published version)

#39 by Bruno Berselli at Tue Mar 07 05:08:40 EST 2017

STATUS

editing

approved

#38 by Bruno Berselli at Tue Mar 07 05:08:36 EST 2017

COMMENTS

a(97) = 79999999999,;

a(98) = 98999999999,;

a(100) = 298999999999,;

#37 by Bruno Berselli at Tue Mar 07 05:07:53 EST 2017

COMMENTS

Other terms: a(97) = 79999999999, a(98) = 98999999999, a(100) = 298999999999.

Other terms:

a(100097) = 299989999999999999999999999999999999999999999999999999999999999999999999979999999999,

a(98) = 98999999999,

a(100) = 298999999999,

a(1000) = 299989999999999999999999999999999999999999999999999999999999999999

999999999999999999999999999999999999999 9999999999999999999999999999999999999999999999.

STATUS

reviewed

editing

#36 by Giovanni Resta at Tue Mar 07 04:50:52 EST 2017

STATUS

proposed

reviewed

#35 by Dimitris Valianatos at Sat Feb 25 12:23:55 EST 2017

STATUS

editing

proposed

#34 by Dimitris Valianatos at Sat Feb 25 12:22:56 EST 2017

PROG

sp=0; p1=p; while(p1, sp += p1%10; p1 \= 10); \\ this is bad!

sp=sumdigits(p);

#33 by Joerg Arndt at Thu Feb 23 05:23:42 EST 2017

PROG

sp=0; p1=p; while(p1, sp += p1%10; p1 \= 10); \\ this is bad!

STATUS

reviewed

editing

#32 by Paolo P. Lava at Thu Feb 23 04:27:14 EST 2017

STATUS

proposed

reviewed

Discussion

Thu Feb 23

04:31

Joerg Arndt: Please use the sumdigits() function in your program.

#31 by Dimitris Valianatos at Wed Feb 22 15:00:26 EST 2017

STATUS

editing

proposed

#30 by Dimitris Valianatos at Wed Feb 22 15:00:19 EST 2017

PROG

print1(10", "2", ");

STATUS

proposed

editing