A055793 - OEIS

%I #46 Sep 08 2022 08:45:01

%S 0,1,4,49,676,9409,131044,1825201,25421764,354079489,4931691076,

%T 68689595569,956722646884,13325427460801,185599261804324,

%U 2585064237799729,36005300067391876,501489136705686529,6984842613812219524,97286307456665386801

%N Numbers n such that n and floor[n/3] are both squares; i.e., squares which remain squares when written in base 3 and last digit is removed.

%C Or, squares of the form 3n^2+1.

%C See A023110, A204503, A204512, A204517, A204519, A055812, A055808 and A055792 for the analog in other bases.

%H Vincenzo Librandi, <a href="/A055793/b055793.txt">Table of n, a(n) for n = 1..800</a>

%H Tom C. Brown and Peter J Shiue, <a href="http://www.fq.math.ca/Scanned/33-4/brown.pdf">Squares of second-order linear recurrence sequences</a>, Fib. Quart., 33 (1994), 352-356.

%H M. F. Hasler, <a href="/wiki/M. F. Hasler/Truncated_squares">Truncated squares</a>, OEIS wiki, Jan 16 2012

%H Giovanni Lucca, <a href="http://forumgeom.fau.edu/FG2018volume18/FG201808index.html">Integer Sequences and Circle Chains Inside a Circular Segment</a>, Forum Geometricorum, Vol. 18 (2018), 47-55.

%H <a href="/index/Sq#sqtrunc">Index to sequences related to truncating digits of squares</a>.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (15,-15,1).

%F a(n) = 3*A098301(n-2)+1. - _R. J. Mathar_, Jun 11 2009

%F a(n) = 14*a(n-1)-a(n-2)-6, with a(0)=1, a(1)=4. (See Brown and Shiue)

%F a(n) = (A001075(n-2))^2. - _Johannes Boot_ Dec 16 2011, corrected by _M. F. Hasler_, Jan 15 2012

%F G.f.: x*(1 - 11*x + 4*x^2)/((1 - x)*(1 - 14*x + x^2)). - _M. F. Hasler_, Jan 15 2012

%e a(3) = 49 because 49 = 7^2 = 1211 base 3 and 121 base 3 = 16 = 4^2.

%p A055793 := proc(n) coeftayl(x*(1-11*x+4*x^2)/((1-x)*(1-14*x+x^2)), x=0, n); end proc: seq(A055793(n), n=0..20); # _Wesley Ivan Hurt_, Sep 28 2014

%t CoefficientList[Series[x*(1 - 11*x + 4*x^2)/((1 - x)*(1 - 14*x + x^2)), {x, 0, 20}], x] (* _Wesley Ivan Hurt_, Sep 28 2014 *)

%t LinearRecurrence[{15,-15,1},{0,1,4,49},40] (* _Harvey P. Dale_, Jun 19 2021 *)

%o (PARI) sq3nsqplus1(n) = { for(x=1,n, y = 3*x*x+1; \ print1(y" ") if(issquare(y),print1(y" ")) ) }

%o (Magma) I:=[0, 1, 4]; [n le 3 select I[n] else 14*Self(n-1) - Self(n-2) - 6: n in [1..30]]; // _Vincenzo Librandi_, Jan 27 2013

%Y Cf. A001075, A023110, A098301.

%Y Cf. also A023110, A204503, A204512, A204517, A204519, A055812, A055808 and A055792 for the analog in other bases.

%K base,nonn,easy

%O 1,3

%A _Henry Bottomley_, Jul 14 2000

%E More terms from _Cino Hilliard_, Mar 01 2003