Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061203 (tau<=)_5(n). +0
6
1, 6, 11, 26, 31, 56, 61, 96, 111, 136, 141, 216, 221, 246, 271, 341, 346, 421, 426, 501, 526, 551, 556, 731, 746, 771, 806, 881, 886, 1011, 1016, 1142, 1167, 1192, 1217, 1442, 1447, 1472, 1497, 1672, 1677, 1802, 1807, 1882, 1957, 1982, 1987, 2337, 2352 (list; graph; listen)
OFFSET

1,2

COMMENT

(tau<=)_k(n) = |{(x_1,x_2,...,x_k): x_1*x_2*...*x_k<=n}|, i.e. (tau<=)_k(n) is number of solutions to x_1*x_2*...*x_k<=n, x_i>0.

Equals row sums of triangle A140705. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 24 2008

FORMULA

(tau<=)_k(n)=Sum_{i=1..n} tau_k(i). a(n)=partial sums of A061200.

CROSSREFS

Cf. tau_2(n): A000005, tau_3(n): A007425, tau_4(n): A007426, tau_5(n): A061200, tau_6(n): A034695, (unordered) 2-factorizations of n: A038548, (unordered) 3-factorizations of n: A034836, A001055, (tau<=)_2(n): A006218, (tau<=)_3(n): A061201, (tau<=)_4(n): A061202, (tau<=)_6(n): A061204.

Cf. A140705.

Adjacent sequences: A061200 A061201 A061202 this_sequence A061204 A061205 A061206

Sequence in context: A063629 A093027 A109296 this_sequence A140359 A136979 A007433

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 21 2001

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research