Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125512
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125512 Array x read by diagonals, where x(i,j) = floor((T(i,j-1)+T(i,j+1))/2) for i>=0 and j>=0. Here T is Wythoff's array A035513. +0
1
1, 2, 5, 3, 7, 7, 5, 12, 11, 10, 9, 20, 18, 16, 14, 14, 32, 29, 27, 22, 16, 23, 52, 47, 43, 36, 25, 19, 38, 85, 76, 70, 58, 41, 31, 21, 61, 137, 123, 114, 94, 67, 50, 34, 25, 99, 222, 199, 184, 152, 108, 81, 56, 40, 28, 161, 360, 322, 298, 246, 175, 132, 90, 65, 45 (list; graph; listen)
OFFSET

0,2

COMMENT

x(i,j)*(x(i,j) + (T(i,j) mod 2)) = (5*T(i,j)^2 - (T(i,j) mod 2))/4 + A(i)*(-1)^j, where A(i)=A022344(i).

FORMULA

For j>1, x(i,j) = x(i,j-1) + x(i,j-2) + (T(i,j-1)*T(i,j-2) mod 2).

EXAMPLE

x(2,4)=floor((T(2,3)+T(2,5))/2)=floor((26+68)/2)=47. Since T(2,4)=42 and A(2)=4, the equation in the first comment becomes 47*(47+0) = (5*42^2-0)/4 + 4*(-1)^4.

MATHEMATICA

T[i_, j_]:=i*Fibonacci[j+1]+Fibonacci[j+2]*Floor[(i+1)(1+Sqrt[5])/2]; x[i_, j_]:=Floor[(T[i, j-1]+T[i, j+1])/2]

CROSSREFS

Cf. A035513, A022344.

Sequence in context: A112486 A141410 A078383 this_sequence A135587 A159016 A083190

Adjacent sequences: A125509 A125510 A125511 this_sequence A125513 A125514 A125515

KEYWORD

nonn

AUTHOR

Kenneth J Ramsey (Ramseykk2(AT)aol.com), Dec 28 2006

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14 2007

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research