Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083662
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083662 a(n)=a([n/2])+a([n/4]), n>0. a(0)=1. +0
2
1, 2, 3, 3, 5, 5, 5, 5, 8, 8, 8, 8, 8, 8, 8, 8, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34 (list; graph; listen)
OFFSET

0,2

FORMULA

For n>0, a(n) = F([log(n)/log(2)]+3) where F(k) denotes the k-th Fibonacci number. For n>=3, F(n) appears 2^(n-3) times. More generally, if p is an integer>1 and a(n)=a([n/p])+a([n/p^2]), n>0, a(0)=1, then for n>0, a(n) = F([log(n)/log(p)]+3).

PROGRAM

(PARI) a(n)=if(n<1, n==0, a(n\2)+a(n\4))

CROSSREFS

Cf. A088468.

Sequence in context: A072923 A131922 A113730 this_sequence A130149 A053046 A066658

Adjacent sequences: A083659 A083660 A083661 this_sequence A083663 A083664 A083665

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 05 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research