Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082498
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082498 a(0)=0, a(1)=1, a(2n)=a(n), a(2n+1)=a(n)+a(n-1). +0
1
0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 3, 2, 3, 1, 3, 2, 3, 2, 4, 3, 5, 1, 4, 3, 4, 2, 5, 3, 5, 1, 4, 3, 4, 2, 5, 3, 5, 2, 5, 4, 6, 3, 7, 5, 8, 1, 6, 4, 5, 3, 7, 4, 7, 2, 6, 5, 7, 3, 8, 5, 8, 1, 6, 4, 5, 3, 7, 4, 7, 2, 6, 5, 7, 3, 8, 5, 8, 2, 7, 5, 7, 4, 9, 6, 10, 3, 9, 7, 10, 5, 12, 8 (list; graph; listen)
OFFSET

0,6

PROGRAM

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

CROSSREFS

Sequence in context: A124830 A026904 A057828 this_sequence A112223 A132881 A060130

Adjacent sequences: A082495 A082496 A082497 this_sequence A082499 A082500 A082501

KEYWORD

nonn

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Apr 29 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