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!)
A173029 Partial sums of naughty primes A164968. 0
10007, 20016, 60025, 130026, 200029, 270038, 360039, 450046, 550049, 750052, 950061, 1250068, 1650077, 2150086, 2850087, 3750088, 4650095, 5650098, 6650131, 7650168, 8650207, 9650288, 10650387, 11650690, 12651093, 13651502, 14652009, 15652618, 16653525 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The subsequence of prime partial sums of naughty primes begins: 10007, 200029, 550049, 6650131. The subsubsequence of naughty prime partial sums of naughty primes begins: 10007, and then what? The smallest square in the sequence is 60025 = 5^2 * 7^4.
LINKS
FORMULA
a(n) = SUM[i=1..n] {p such that p is prime and the number of zeros in the decimal representation of p is greater than the number of all other digits}.
EXAMPLE
a(24) = 10007 + 10009 + 40009 + 70001 + 70003 + 70009 + 90001 + 90007 + 100003 + 200003 + 200009 + 300007 + 400009 + 500009 + 700001 + 900001 + 900007 + 1000003 + 1000033 + 1000037 + 1000039 + 1000081 + 1000099 + 1000303.
MATHEMATICA
Accumulate[Select[Prime[Range[100000]], DigitCount[#, 10, 0]> IntegerLength[ #]/2&]] (* Harvey P. Dale, Jun 09 2015 *)
CROSSREFS
Sequence in context: A165296 A182697 A101442 * A256838 A176931 A023335
KEYWORD
base,easy,nonn
AUTHOR
Jonathan Vos Post, Feb 07 2010
EXTENSIONS
Corrected and extended by Harvey P. Dale, Jun 09 2015
STATUS
approved

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 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)