The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094769 Square spiral of sums of selected preceding terms, starting at 0 followed by 1 (a spiral Fibonacci-like sequence). 5

%I #17 Aug 13 2018 09:03:02

%S 0,1,1,2,4,6,12,18,37,56,94,189,285,475,952,1434,2392,3830,7666,11518,

%T 19202,30732,61482,92281,153874,246248,400178,800450,1200967,2001985,

%U 3203426,5205696,10411867,15619275,26034003,41658056,67695885,109356333

%N Square spiral of sums of selected preceding terms, starting at 0 followed by 1 (a spiral Fibonacci-like sequence).

%C Enter 0 into center position and 1 into next position of the spiral. Repeat: Add to the number in the present position the numbers in all those already filled positions that are horizontally, vertically or diagonally adjacent to it, go to next position of the spiral and enter the sum into it.

%C a(1) = 0, a(2) = 1, a(n) = a(n-1) + Sum_{i < n-1 and a(i) is adjacent to a(n-1)} a(i).

%C As in A094767 eight positions are considered adjacent here.

%C Clockwise and counterclockwise construction of the spiral result in the same sequence.

%H Klaus Brockhaus, <a href="/A094769/b094769.txt">Table of n, a(n) for n = 1..729</a>

%e Clockwise constructed spiral begins

%e .

%e 19202--30732--61482--92281-153874

%e |

%e |

%e 11518 12-----18-----37-----56

%e | | |

%e | | |

%e 7666 6 0------1 94

%e | | | |

%e | | | |

%e 3830 4------2------1 189

%e | |

%e | |

%e 2392---1434----952----475----285

%e .

%e where

%e a(1) = 0,

%e a(2) = 1,

%e a(3) = a(2) + a(1) = 1,

%e a(4) = a(3) + a(2) + a(1) = 2,

%e a(5) = a(4) + a(3) + a(2) + a(1) = 4,

%e a(6) = a(5) + a(4) + a(1) = 6,

%e a(7) = a(6) + a(5) + a(4) + a(1) = 12.

%o (PARI) {m=5; h=2*m-1; A=matrix(h, h); print1(A[m, m]=0, ","); print1(A[m, m+1]=1, ","); pj=m; pk=m+1; T=[[1, 0], [1, -1], [0, -1], [ -1, -1], [ -1, 0], [ -1, 1], [0, 1], [1, 1]]; for(n=2, (h-2)^2-1, g=sqrtint(n); r=(g+g%2)\2; q=4*r^2; d=n-q; if(n<=q-2*r, j=d+3*r; k=r, if(n<=q, j=r; k=-d-r, if(n<=q+2*r, j=r-d; k=-r, j=-r; k=d-3*r))); j=j+m; k=k+m; s=A[pj, pk]; for(c=1, 8, v=[pj, pk]; v+=T[c]; s=s+A[v[1], v[2]]); A[j, k]=s; print1(s, ","); pj=j; pk=k)} \\ _Klaus Brockhaus_, Aug 27 2008

%Y Cf. A063826, A094767, A094768, A126937, A141481.

%K nonn

%O 1,4

%A _Yasutoshi Kohmoto_, Jun 10 2004

%E Edited and extended beyond a(12) by _Klaus Brockhaus_, Aug 27 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 19:36 EDT 2024. Contains 372666 sequences. (Running on oeis4.)