Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096273
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096273 a(0)=0, then a(n)=a(n-1)+(n-1) if n is odd, a(n)=a(n/2)+n/2 otherwise. +0
2
0, 0, 1, 3, 3, 7, 6, 12, 7, 15, 12, 22, 12, 24, 19, 33, 15, 31, 24, 42, 22, 42, 33, 55, 24, 48, 37, 63, 33, 61, 48, 78, 31, 63, 48, 82, 42, 78, 61, 99, 42, 82, 63, 105, 55, 99, 78, 124, 48, 96, 73, 123, 63, 115, 90, 144, 61, 117, 90, 148, 78, 138, 109, 171, 63, 127, 96, 162, 82 (list; graph; listen)
OFFSET

0,4

FORMULA

a(n) mod 2 = A095190(n); a(2n) mod 2= a(2n+1) mod 2 = A010060(n); a(3n)=0 mod 3

PROGRAM

(PARI) a(n)=if(n<1, 0, if(n%2, a(n-1)+n-1, a(n/2)+(n/2)))

CROSSREFS

Adjacent sequences: A096270 A096271 A096272 this_sequence A096274 A096275 A096276

Sequence in context: A098043 A045773 A078708 this_sequence A069981 A000199 A105670

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 23 2004

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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research