Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132802
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132802 a(0)=1. a(n) = sum{k|n} a(floor(k/2)). +0
1
1, 1, 2, 2, 4, 3, 5, 3, 8, 6, 7, 4, 12, 6, 7, 7, 16, 9, 15, 7, 16, 11, 9, 5, 28, 15, 13, 12, 16, 8, 20, 8, 32, 21, 19, 14, 37, 16, 15, 14, 36, 17, 28, 12, 20, 20, 11, 6, 64, 31, 34, 25, 28, 14, 33, 18, 36, 24, 17, 9, 54, 21, 17, 23, 64, 40, 49, 22, 40, 25 (list; graph; listen)
OFFSET

0,3

COMMENT

a(2^m) = 2^m, for all nonnegative integers m.

EXAMPLE

The positive divisors of 12 are 1,2,3,4,6,12. These divisors divided by 12, and rounded down, are 0,1,1,2,3,6. So a(12) = a(0)+a(1)+a(1)+a(2)+a(3)+a(6) = 1+1+1+2+2+5 = 12.

MATHEMATICA

a = {1}; For[n = 1, n < 70, n++, s = 0; For[j = 1, j < Length[Divisors[n]] + 1, j++, s = s + a[[Floor[Divisors[n][[j]]/2] + 1]]]; AppendTo[a, s]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 20 2007

CROSSREFS

Sequence in context: A133438 A086671 A054346 this_sequence A070803 A071693 A007728

Adjacent sequences: A132799 A132800 A132801 this_sequence A132803 A132804 A132805

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Nov 17 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 20 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 December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research