id:A092479 - OEIS Search Results

Search: id:A092479

Displaying 1-1 of 1 results found.

page 1

T(n,k) = number of numbers <= 2^n having exactly k prime factors (with repetitions), 0<=k<=n, triangle read by rows.

+0
1

1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 6, 6, 2, 1, 1, 11, 10, 7, 2, 1, 1, 18, 22, 13, 7, 2, 1, 1, 31, 42, 30, 14, 7, 2, 1, 1, 54, 82, 60, 34, 15, 7, 2, 1, 1, 97, 157, 125, 71, 36, 15, 7, 2, 1, 1, 172, 304, 256, 152, 77, 37, 15, 7, 2, 1, 1, 309, 589, 513, 325, 168, 81, 37, 15, 7, 2, 1, 1, 564 (list; table; graph; listen)

	OFFSET	`0,5`
	COMMENT	`T(n,0)=1; T(n,1)=A007053(n,1) for n>0; T(n,n)=1;` `Sum(T(n,k): 0<=k<=n) = 2^n.`
	LINKS	`Index entries for sequences related to numbers of primes in various ranges`
	CROSSREFS	`Cf. A001222.` `Sequence in context: A124939 A099020 A089688 this_sequence A124022 A098063 A106396` `Adjacent sequences: A092476 A092477 A092478 this_sequence A092480 A092481 A092482`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 27 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research