Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136615
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A136615
%S A136615 1,2,0,0,0,16,16,16,112,112,112,912,912,912,7280,7280,7280,58256,58256,
%T A136615 58256,466032,466032,466032,3728272,3728272,3728272,29826160,29826160,
%U A136615 29826160,238609296,238609296,238609296,1908874352,1908874352
%N A136615 Fold-switch-fold sequence defined by McFarlane and Withers for m=3: Let 
               A(n) = If[Mod[A(n - 1), 2] == 0, A(n - 1)/2, (m - A(n - 1))2]; a(n)= 
               If[ Mod[A(n - 1), 2] == 0, a(n - 1)/2, (Pi - a(n - 1))/2].
%D A136615 Cayanne McFarlane and Wm. Douglas Withers; Dynamical Systems and Irrational 
               Angle Construction by Paper-Folding, American Mathematical Monthly, 
               Volume 115, Number 4, 2008, page 356; http://www.maa.org/pubs/monthly_apr08_toc.html.
%F A136615 m=3,A(0)=1;a(1)=(m-1)/2; A(n) = If[Mod[A(n - 1), 2] == 0, A(n - 1)/2, 
               (m - A(n - 1))2]; a(0) = Pi; a(1) = Pi; a(n)= If[ Mod[A(n - 1), 2] 
               == 0, a(n - 1)/2, (Pi - a(n - 1))/2]; output=2^n*a(n)/Pi
%t A136615 Clear[A, m, n] m = 3; A[0] = 1; A[1] = (m - 1)/2; A[n_] := A[n] = If[Mod[A[n 
               - 1], 2] == 0, A[n - 1]/2, (m - A[n - 1])2]; a[0] = Pi; a[1] = Pi; 
               a[n_] := a[n] = If[ Mod[A[n - 1], 2] == 0, a[n - 1]/2, (Pi - a[n 
               - 1])/2]; Table[2^n*a[n]/Pi, {n, 0, 50}]
%Y A136615 Sequence in context: A158801 A107491 A063698 this_sequence A029696 A118887 
               A057383
%Y A136615 Adjacent sequences: A136612 A136613 A136614 this_sequence A136616 A136617 
               A136618
%K A136615 nonn
%O A136615 1,2
%A A136615 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 31 2008

    
page 1

Search completed in 0.001 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research