Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113758
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113758 a(n) is the least number having sum of digits n in base 10 and also exactly n prime factors (counted with multiplicity). +0
1
10001, 12, 40, 32, 240, 3040, 2240, 1152, 6400, 12800, 21504, 440320, 2140160, 172032, 4710400, 1802240, 1327104, 20316160, 40632320, 17301504, 152043520 (list; graph; listen)
OFFSET

2,1

EXAMPLE

a(2)=10001 since 1+0+0+0+1=2 and 10001=73*137 has 2 prime factors.

a(3)=12 since 1+2=3 and 12=2*2*3 has 3 prime factors.

MATHEMATICA

Lk[n_] := Block[{k = 2}, While[n != Plus @@ IntegerDigits[k] || n != Plus @@ (Transpose[FactorInteger@k][[2]]), k++ ]; k]; L = {}; Do[v = Lk[n]; Print[{n, v}]; AppendTo[L, v], {n, 2, 13}]; L

CROSSREFS

Cf. A115156.

Sequence in context: A017644 A013857 A091566 this_sequence A115850 A082567 A031688

Adjacent sequences: A113755 A113756 A113757 this_sequence A113759 A113760 A113761

KEYWORD

base,nonn

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it), Jan 18 2006

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research