The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022344 Allan Wechsler's "J determinant" sequence. 4
 1, 5, 4, 9, 16, 11, 19, 11, 20, 31, 19, 31, 45, 29, 44, 25, 41, 59, 36, 55, 29, 49, 71, 41, 64, 89, 55, 81, 44, 71, 100, 59, 89, 121, 76, 109, 61, 95, 131, 79, 116, 61, 99, 139, 80, 121, 164, 101, 145, 79, 124, 171, 101, 149, 76, 125, 176, 99, 151, 205 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS From Kenneth J Ramsey, Jan 06 2007: (Start) "a(n) = the characteristic value of the row T(n,i) of the Wythoff array A035513 which is the absolute value of T(n,i)^2 - T(n,i-1)*T(n,i+1). Only the number 5 or prime factors ending in 1 or 9 form the squarefree portion of a(n). All other factors of a(n) appear only as squares. "Moreover, the squarefree portion (less the factor 5) squared is the characteristic value of the Fibonacci sequence whose bijection relates to c term of the Horadam "Fibonacci Number Triples" Amer. Math. Monthly 68(1961) 751-753. That paper showed that if F(0), F(1), F(2), F(3) are 4 sequential numbers in a row of the Wythoff array, then P = (2F(1)*F(2),F(0)*F(1),2F(1)*F(2) + F(0)^2) is a Pythagorean triple (a,b,c) i.e. a^2 + b^2 = c^2. "If i varies and c(n,2i-1) = F(n,i)^2 + 2F(n,i+1)*F(n,i+2) and C(n,2i) is set to equal C(n,2i+1)-C(n,2i-1) then, the sequence F(x,i) = C(n,i)/G, where G is the greatest common divisor of the adjacent terms C(n,i), is a Fibonacci sequence having the characteristic value which is the square of the squarefree portion of a(n) except without the factor of 5. "For example the Lucas sequence or the second row of the Wythoff array has the characteristic value of A(2) = 5 and the C(n,i) terms are each 5 times the sequential terms 34,89,233,... which is a bijection of the terms in the 1st row of the Wythoff array which row has the characteristic value of 1. This is so even though adjacent terms of the Lucas sequence are coprime." (End) Conjecture: Every pair of Fibonacci sequences, F1 and F2, appear in rows n and m of Wythoff's Array, respectively and have respective characteristics a(n) and a(m). Also, there is a third Fibonacci sequence F3, defined by F3(i) = F1(i) * F2(j+1) - F1(i+1)*F2(j) where j is held constant. The sequence F3 appears in row p of Wythoff's array and has the characteristic a(p) = a(n)*a(m). - Kenneth J Ramsey, Feb 11 2007 a(n) = |T(n,i)^2 - T(n,i-2)*T(n,i+2)| for all i > 2, where T = Wythoff array.  Indeed, if k > 0, then |T(n,i)^2 - T(n,j-k)*T(n,j+k)| = (F(k)^2)*A022344(n)  for j > k.  That is, if m is in A022344, then 4*m, 9*m, 25*m, 64*m, ... are also in A022344.  - Clark Kimberling, Jul 15 2016 REFERENCES Allan C. Wechsler, posting to math-fun mailing list Dec 04 1996. LINKS Michael De Vlieger, Table of n, a(n) for n = 0..10000 A. F. Horadam, Fibonacci Number Triples, The American Mathematical Monthly, Vol. 68, No. 8 (Oct., 1961), pp. 751-753. FORMULA a(n) = floor((n+1)*tau)^2 - n*floor((n+1)*tau) - n^2. MAPLE Digits := 50: t := evalf((1+sqrt(5))/2): f := n->floor( n*t)^2-(n-1)*floor(n*t)-(n-1)^2: MATHEMATICA Table[#^2 - n # - n^2 &[Floor[(n + 1) GoldenRatio]], {n, 0, 51}] (* Michael De Vlieger, Jun 30 2016 *) PROG (MAGMA) [Floor((n+1)*((1+Sqrt(5))/2))^2-n*Floor((n+1)*(1+Sqrt(5))/2)-n^2: n in [0..60]]; // Vincenzo Librandi, Jul 01 2016 CROSSREFS Cf. A035513, A127561, A275068. Sequence in context: A102081 A068397 A236405 * A046588 A086654 A286461 Adjacent sequences:  A022341 A022342 A022343 * A022345 A022346 A022347 KEYWORD nonn AUTHOR STATUS approved

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

Last modified May 5 22:32 EDT 2021. Contains 343578 sequences. (Running on oeis4.)