login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046184 Indices of octagonal numbers which are also square. 9
1, 9, 121, 1681, 23409, 326041, 4541161, 63250209, 880961761, 12270214441, 170902040409, 2380358351281, 33154114877521, 461777249934009, 6431727384198601, 89582406128846401, 1247721958419651009 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The equation a(t)*(3*a(t)-2)=m*m is equivalent to the Pell equation (3*a(t)-1)*(3*a(t)-1)-3*m*m=1. - Paul Weisenhorn, May 12 2009

As n increases, this sequence is approximately geometric with common ratio r = lim(n -> Infinity, a(n)/a(n-1)) = (2 + sqrt(3))^2 = 7 + 4 * sqrt(3)  - Ant King, Nov 16 2011

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..200

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

Nearest integer to 1/6 * (2+sqrt(3))^(2n-1). - Ralf Stephan, Feb 24 2004

a(n) = A045899(n-1) + 1 = A051047(n+1) + 1 = A003697(2n-2). - N. J. A. Sloane, Jun 12 2004

a(n) = (A001835(n))^2. - Lekraj Beedassy, Jul 21 2006

Contribution from Paul Weisenhorn, May 12 2009: (Start)

With A=(2+sqrt(3))^2=7+4*sqrt(3) the equation x*x-3*m*m=1 has solutions

x(t)+sqrt(3)*m(t)=(2+sqrt(3))*A^t and the recurrences

x(t+2)=14*x(t+1)-x(t) with <x(t)> = 2,26,362,5042

m(t+2)=14*m(t+1)-m(t) with <m(t)> = 1,15,209,2911

a(t+2)=14*a(t+1)-a(t)-4 with <a(t)> = 1,9,121, as above. (End)

From Ant King, Nov 15 2011: (Start)

a(n) = 14*a(n-1) - a(n-2) - 4.

a(n) = 15*a(n-1) - 15*a(n-2) + a(n-3).

a(n) = (1/6)*( (2+sqrt(3))^(2n-1) + (2-sqrt(3))^(2n-1) + 2 ).

a(n) = ceiling( (1/6)*(2 + sqrt(3))^(2n-1) ).

a(n) = (1/6)*( (tan(5*pi/12))^(2n-1) + (tan(pi/12))^(2n-1) + 2 ).

a(n) = ceiling ( (1/6)*(tan(5*pi/12))^(2n-1) ).

G.f.: x*(1-6*x+x^2) / ((1-x)*(1-14*x+x^2)). (End)

MAPLE

Contribution from Paul Weisenhorn, May 12 2009: (Start)

for n from 1 to 10000 do m=sqrt(3*n*n-2*n): if (trunc(m)=m) then print(n, m):

end if: end do: (End)

MATHEMATICA

LinearRecurrence[ {15, -15, 1}, {1, 9, 121}, 17 ] (* Ant King, Nov 16 2011 *)

PROG

(MAGMA) I:=[1, 9, 121]; [n le 3 select I[n] else 15*Self(n-1)-15*Self(n-2)+Self(n-3): n in [1..20]]; // Vincenzo Librandi, Nov 17 2011

CROSSREFS

Cf. A028230, A036428.

Sequence in context: A103930 A183514 A138978 * A084769 A202835 A050353

Adjacent sequences:  A046181 A046182 A046183 * A046185 A046186 A046187

KEYWORD

nonn,easy

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 23:58 EST 2012. Contains 206085 sequences.