Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097419
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097419 a(1) = 2, a(n) = 2*a(n-1)^2 - a(n-1) for n > 1. +0
2
2, 6, 66, 8646, 149497986, 44699295486614406, 3996054033999333969062944766851266, 31936895685284700329548847429175178142518023225832967407199564754246 (list; graph; listen)
OFFSET

1,1

COMMENT

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)).]

CROSSREFS

Cf. A090475.

Sequence in context: A006517 A091458 A087331 this_sequence A156458 A136268 A030242

Adjacent sequences: A097416 A097417 A097418 this_sequence A097420 A097421 A097422

KEYWORD

nonn

AUTHOR

Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Aug 19 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research