

A152672


a(n) is the number of distinct tuples of up to k bit locations in Lbit words, in which, if bits are perturbed, the resulting change in unsigned Lbit value is n, for L=8 and k=7.


0



7, 7, 12, 6, 16, 11, 15, 5, 18, 14, 22, 9, 21, 13, 16, 4, 18, 15, 25, 11, 28, 18, 24, 7, 23, 17, 26, 10, 22, 13, 15, 3, 16, 14, 24, 11, 29, 19, 26, 8, 28, 21, 33, 13, 30, 18, 22, 5, 21, 17, 28, 12, 30, 19, 25, 7, 22, 16, 24, 9, 19, 11, 12, 2, 12, 11, 19, 9, 24, 16, 22, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS

Table of n, a(n) for n=1..72.


EXAMPLE

For n=5, a(5) = 16, i.e., there are 16 possible tuples of up to k bit positions in Lbit words, in which, if the bits corresponding to the tuple are perturbed, can lead to a change in the word's unsigned value by 5, for L=8 and k=7. For n=254, a(254) = 1, i.e., there is only one tuple of up to k bit positions in an Lbit word, for which, if the bits are perturbed, will lead to a change in the word's value by 254, for L=8 and k=7; this tuple corresponds to perturbing all but the least significant bit in a word of all zeros or all ones.


CROSSREFS

For a given n, while a(n) in this sequence gives the number of distinct tuples of up to k bit positions that may be perturbed to yield a change in value of n, A152524 gives the number of ways (accounting for both positions and types of perturbations, i.e., whether 0>1 or 1>0) in which up to k bit positions in an Lbit word may be perturbed, to yield a change in the word's value, of n, for L=8 and k=7.
Sequence in context: A213886 A053673 A204910 * A003883 A212535 A266116
Adjacent sequences: A152669 A152670 A152671 * A152673 A152674 A152675


KEYWORD

fini,nonn


AUTHOR

Phillip StanleyMarbell (phillip.stanleymarbell(AT)gmail.com), Dec 10 2008


STATUS

approved



