Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A105670
%S A105670 1,1,3,3,7,7,5,5,15,15,13,13,9,9,11,11,31,31,29,29,25,25,27,27,17,17,19,
%T A105670 19,23,23,21,21,63,63,61,61,57,57,59,59,49,49,51,51,55,55,53,53,33,33,
%U A105670 35,35,39,39,37,37,47,47,45,45,41,41,43,43,127,127,1,25,125,121,121,123
%N A105670 a(1)=1 then letting f(n)=2^n for f(n)<k<=f(n+1) a(k)=f(n+1)-a(k-f(n)) 
               (b(n,2) using pari code).
%F A105670 a(2n-1)=a(2n)
%F A105670 a(n)=2a(ceil(n/2))-1+2t(ceil(n/2)-1) where t(n)=A010060(n) is the Thue-Morse 
               sequence
%o A105670 (PARI) b(n,m)=if(n<2,1,m*m^floor(log(n-1)/log(m))-b(n-m^floor(log(n-1)/
               log(m)),m))
%Y A105670 Cf. A105669, A105672, A093347, A093348.
%Y A105670 Sequence in context: A000199 A161771 A160515 this_sequence A003817 A092474 
               A107470
%Y A105670 Adjacent sequences: A105667 A105668 A105669 this_sequence A105671 A105672 
               A105673
%K A105670 nonn
%O A105670 1,3
%A A105670 Benoit Cloitre (benoit7848c(AT)orange.fr), May 03 2005

    
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research