Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134467 a(n) = n(n+1) - A000120(n), where A000120(n) = number of 1's in binary expansion of n. +0
1
0, 1, 5, 10, 19, 28, 40, 53, 71, 88, 108, 129, 154, 179, 207, 236, 271, 304, 340, 377, 418, 459, 503, 548, 598, 647, 699, 752, 809, 866, 926, 987, 1055, 1120, 1188, 1257, 1330, 1403, 1479, 1556, 1638, 1719, 1803, 1888, 1977, 2066, 2158, 2251, 2350, 2447, 2547 (list; graph; listen)
OFFSET

0,3

FORMULA

2^a(n) = denominator of [x^n] (1+x)^(1/2^n) for n>=0 (see A134098); similarily, 2^a(n) = denominator of [x^n] 1/(1-x)^(1/2^n) for n>=0 (see A134097).

PROGRAM

(PARI) a(n)=n*(n+1) - subst(Pol(binary(n)), x, 1)

CROSSREFS

Cf. A000120; A134097, A134098.

Adjacent sequences: A134464 A134465 A134466 this_sequence A134468 A134469 A134470

Sequence in context: A091922 A030776 A115289 this_sequence A047882 A053311 A147390

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 27 2007

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research