A159669 - OEIS

This site is supported by donations to The OEIS Foundation.

A159669

The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 13*n(j)+1=a(j)*a(j) and 15*n(j)+1=b(j)*b(j) with positive integer numbers.

1, 29, 811, 22679, 634201, 17734949, 495944371, 13868707439, 387827863921 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	LINKS	`Table of n, a(n) for n=1..9.`
	FORMULA	`The a(j) recurrence is a(1)=1; a(2)=27; a(t+2)=28a(t+1)-a(t)` `resulting in terms 1, 27, 755, 21113` `The b(j) recurrence is b(1)=1; b(2)=29; b(t+2)=28b(t+1)-b(t)` `resulting in terms 1, 29, 811, 22679 as listed above` `The n(j) recurrence is n(0)=n(1)=0; n(2)=56; n(t+3)=783*(n(t+2)-n(t+1))+n(t)` `resulting in terms 0, 0, 56, 43848, 34289136.`
	MAPLE	`for a from 1 by 2 to 100000 do b:=sqrt((15aa-2)/13): if (trunc(b)=b) then` `n:=(a*a-1)/13: La:=[op(La), a]:Lb:=[op(Lb), b]:Ln:=[op(Ln), n]: endif: enddo:`
	CROSSREFS	`A157456, A159668` `Sequence in context: A135995 A046850 A180844 * A144746 A162831 A163207` `Adjacent sequences: A159666 A159667 A159668 * A159670 A159671 A159672`
	KEYWORD	`nonn`
	AUTHOR	`Paul Weisenhorn, Apr 19 2009`
	STATUS	`approved`

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

Last modified May 23 17:52 EDT 2013. Contains 225611 sequences.