Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007538
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A007538 M0432
%S A007538 2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,3,2,3,3,3,2,3,
%T A007538 3,2,3,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,
%U A007538 3,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,3,2,3,3,3,2,3
%N A007538 A self-generating sequence: there are a(n) 3's between successive 2's.
%D A007538 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007538 Problem A-6, Amer. Math. Monthly, 101 (1994), 727-728.
%D A007538 Problem, Math. Mag., 67 (No. 2, 1994), 157-158.
%F A007538 a(n)=[ n*(1+sqrt(3)) ]-[ (n-1)*(1+sqrt(3)) ].
%F A007538 a(n)=f(n,2,2,2) with f(n,b,c,i) = if n=1 then b else (if c=0 then f(n-1,
               2,a(i),i+1) else f(n-1,3,c-1,i)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               May 25 2009]
%Y A007538 Sequence in context: A096006 A131294 A102313 this_sequence A025076 A110006 
               A137779
%Y A007538 Adjacent sequences: A007535 A007536 A007537 this_sequence A007539 A007540 
               A007541
%K A007538 nonn,easy,nice
%O A007538 1,1
%A A007538 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

    
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 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research