Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067894
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067894 Write 0, 1, ..., n in binary and add as if they were decimal numbers. +0
4
0, 1, 11, 22, 122, 223, 333, 444, 1444, 2445, 3455, 4466, 5566, 6667, 7777, 8888, 18888, 28889, 38899, 48910, 59010, 69111, 79221, 89332, 100332, 111333, 122343, 133354, 144454, 155555, 166665, 177776, 277776, 377777, 477787, 577798, 677898 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) (Mod 10) = Floor((n+1)/2). - Robert G. Wilson v (rgwv(AT)rgwv.com), May 15 2003

EXAMPLE

a(6) = 0 + 1 + 10 + 11 + 100 + 101 + 110 = 333.

MAPLE

for n from 0 to 50 do s := 0: for j from 0 to n do s := s+convert(j, binary): od: printf(`%d, `, s): od:

MATHEMATICA

f[n_] := Apply[Plus, Table[ FromDigits[ IntegerDigits[i, 2]], {i, 0, n}]]; Table[ f[n], {n, 0, 36}]

CROSSREFS

Cf. A067895.

Sequence in context: A091784 A061852 A083511 this_sequence A094620 A077431 A118133

Adjacent sequences: A067891 A067892 A067893 this_sequence A067895 A067896 A067897

KEYWORD

nonn,base,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), based on a suggestion of Anne Donovan (anned3005(AT)aol.com) May 15 2003

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Ray Chandler (rayjchandler(AT)sbcglobal.net) and James A. Sellers (sellersj(AT)math.psu.edu), May 15, 2003

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research