login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097419 a(1) = 2, a(n) = 2*a(n-1)^2 - a(n-1) for n > 1. 2

%I #3 Mar 31 2012 14:11:11

%S 2,6,66,8646,149497986,44699295486614406,

%T 3996054033999333969062944766851266,

%U 31936895685284700329548847429175178142518023225832967407199564754246

%N a(1) = 2, a(n) = 2*a(n-1)^2 - a(n-1) for n > 1.

%C These numbers when factored are 2*3, 2*3*11, 2*3*11*131, 2*3*11*131*17291, 2*3*11*131*17291*298995971, 2*3*11*131*8779*10079*17291*298995971*1010341471, 2*3*11*29*59*131*241*8779*10079*17291*298995971*1010341471*2511683491*7716660340023314591, so a(n) is a prime multiple of a(n-1) for 2<=n<=6. 2,3,11,131,17291,298995971 are A090475 [Beginning with 2, a(n+1) is the least prime == -1 (mod (product a(i), i=1 to n)).]

%Y Cf. A090475.

%K nonn

%O 1,1

%A _Gerald McGarvey_, Aug 19 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)