id:A118462 - OEIS Search Results

Search: id:A118462

Displaying 1-1 of 1 results found.

page 1

Decimal equivalent of binary encoding of partitions into distinct parts.

+0
2

0, 1, 2, 3, 4, 5, 8, 6, 9, 16, 7, 10, 17, 32, 11, 12, 18, 33, 64, 13, 19, 20, 34, 65, 128, 14, 21, 24, 35, 36, 66, 129, 256, 15, 22, 25, 37, 40, 67, 68, 130, 257, 512, 23, 26, 38, 41, 48, 69, 72, 131, 132, 258, 513, 1024, 27, 28, 39, 42, 49, 70, 73, 80, 133, 136, 259, 260, 514 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A part of size k in the partition makes the 2^(k-1) bit of the number be 1. The partitions of n are in reverse Mathematica ordering, so that each row is in ascending order. This is a permutation of the nonnegative integers.`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	EXAMPLE	`Partition 11 is [4,2], which gives binary 1010 (2^(4-1)+2^(2-1)), or 10, so a(11)=10.`
	CROSSREFS	`Cf. A118463, A118457, A000009 (row lengths).` `Adjacent sequences: A118459 A118460 A118461 this_sequence A118463 A118464 A118465` `Sequence in context: A130942 A082359 A085176 this_sequence A122317 A130992 A122318`
	KEYWORD	`base,nonn,tabf`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 28 2006`

page 1

Search completed in 0.002 seconds

Last modified October 13 18:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research