Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099011
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099011 Pell pseudoprimes: odd composite numbers n such that P(n)-kronecker(2,n) is divisible by n. +0
2
169, 385, 741, 961, 1121, 2001, 3827, 4879, 5719, 6215, 6265, 6441, 6479, 6601, 7055, 7801, 8119, 9799, 10945, 11395, 13067, 13079, 13601, 15841, 18241, 19097, 20833, 20951, 24727, 27839, 27971, 29183, 29953, 31417, 31535, 34561, 35459, 37345 (list; graph; listen)
OFFSET

1,1

COMMENT

Here P(n) are the Pell numbers (A000129), defined by P(0)=0, P(1)=1, P(x)=2*P(x-1)+P(x-2) and kronecker(2,n) is equal to 1 if n is congruent to +/-1 mod 8 and equal to -1 if n is congruent to +/-3 mod 8.

LINKS

Ralf Stephan, Table of n, a(n) for n = 1..200 (Pell pseudoprimes up to 1000000)

EXAMPLE

169 is a Pell pseudoprime because P(169)-kronecker(2,169) is divisible by 169.

CROSSREFS

Cf. A000129.

Adjacent sequences: A099008 A099009 A099010 this_sequence A099012 A099013 A099014

Sequence in context: A018820 A020249 A156159 this_sequence A112076 A069645 A017534

KEYWORD

nonn

AUTHOR

Jack Brennen (jb(AT)brennen.net), Nov 13 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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research