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!)
A158084 Prime numbers, with a(1)=2, a(n+1) = least prime such that (sum of even digits of a(n)) < (sum of even digits of a(n+1)). 0

%I #19 Mar 20 2021 11:04:27

%S 2,41,61,83,281,487,683,881,2887,4889,6883,8887,46889,48883,68881,

%T 88883,468883,688861,688889,888887,2888887,4888889,8868887,28886881,

%U 28888883,48888887,88888867,88888883,288888889,668888887,688888883,888888883

%N Prime numbers, with a(1)=2, a(n+1) = least prime such that (sum of even digits of a(n)) < (sum of even digits of a(n+1)).

%t f[n_] := Block[{m = Total@ Select[ IntegerDigits@ n, EvenQ], p = 2}, While[ Total@ Select[ IntegerDigits@ p, EvenQ] <= m, p = NextPrime@ p]; p]; NestList[f, 2, 31] (* _Robert G. Wilson v_, Jun 23 2014 *)

%Y Cf. A000040.

%K nonn,base,less

%O 1,1

%A _Juri-Stepan Gerasimov_, Mar 12 2009, Mar 18 2009

%E Definition corrected by _N. J. A. Sloane_, Mar 19 2009

%E a(12) from _Alvin Hoover Belt_, May 20 2009

%E Definition clarified by _D. S. McNeil_, Dec 10 2009

%E Missing values 683 and 8887 inserted and extended by _D. S. McNeil_, Dec 10 2009

%E a(26) - a(32) from _Robert G. Wilson v_, Jun 23 2014

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 April 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)