Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137269
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137269 Number of primes with maximal digit product for a digit sum of n. +0
1
0, 1, 1, 2, 1, 0, 2, 1, 0, 1, 2, 0, 5, 1, 0, 4, 3, 0, 8, 2, 0, 2, 2, 0, 4, 1, 0, 1 (list; graph; listen)
OFFSET

1,4

EXAMPLE

a(19)=8 and a(20)=2 because we respectively have the 8 primes 333433, 334333, 343333, 2332333, 2333323, 3223333, 3233323, 3332233 all with a maximal digit product of 3^5*2^2 = 972 for a digit sum of 19, and the 2 primes 3233333, 3333233 with maximal digit product 3^6*2 = 1458 for digit sum 20.

CROSSREFS

Cf. A137248, A136150, A138975, A133223, A000792.

Sequence in context: A138514 A030200 A095734 this_sequence A112201 A112203 A132798

Adjacent sequences: A137266 A137267 A137268 this_sequence A137270 A137271 A137272

KEYWORD

more,nonn,base

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Apr 05 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research