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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276266 a(0) = a(1) = a(2) = 1; for n>2, a(n) = ( a(n-1)*a(n-2) + 1 )^2 / a(n-3). 2
1, 1, 1, 4, 25, 10201, 16259565169, 1100432328310492581042546436, 31383529740086705883339675381564403354342372463018335778292540655564225 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..10

FORMULA

a(n) = A208209(n)^2.

MATHEMATICA

RecurrenceTable[{a[n] == (a[n - 1] a[n - 2] + 1)^2/a[n - 3], a[0] == a[1] == a[2] == 1}, a, {n, 0, 8}] (* Michael De Vlieger, Aug 26 2016 *)

PROG

(Ruby)

def A(m, n)

  a = Array.new(m, 1)

  ary = [1]

  while ary.size < n + 1

    i = a[1..-1].inject(:*) + 1

    i *= i

    break if i % a[0] > 0

    a = *a[1..-1], i / a[0]

    ary << a[0]

  end

  ary

end

def A276266(n)

  A(3, n)

end

CROSSREFS

Cf. A081068, A208209.

Sequence in context: A317699 A284106 A063802 * A276268 A086909 A046963

Adjacent sequences:  A276263 A276264 A276265 * A276267 A276268 A276269

KEYWORD

nonn

AUTHOR

Seiichi Manyama, Aug 26 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 19:13 EDT 2019. Contains 323576 sequences. (Running on oeis4.)