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
%I A099011
%S A099011 169,385,741,961,1121,2001,3827,4879,5719,6215,6265,6441,6479,6601,7055,
%T A099011 7801,8119,9799,10945,11395,13067,13079,13601,15841,18241,19097,20833,
%U A099011 20951,24727,27839,27971,29183,29953,31417,31535,34561,35459,37345
%N A099011 Pell pseudoprimes: odd composite numbers n such that P(n)-kronecker(2,
               n) is divisible by n.
%C A099011 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.
%H A099011 Ralf Stephan, <a href="b099011.txt">Table of n, a(n) for n = 1..200</
               a> (Pell pseudoprimes up to 1000000)
%e A099011 169 is a Pell pseudoprime because P(169)-kronecker(2,169) is divisible 
               by 169.
%Y A099011 Cf. A000129.
%Y A099011 Sequence in context: A018820 A020249 A156159 this_sequence A112076 A069645 
               A017534
%Y A099011 Adjacent sequences: A099008 A099009 A099010 this_sequence A099012 A099013 
               A099014
%K A099011 nonn
%O A099011 1,1
%A A099011 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 December 4 12:48 EST 2009. Contains 170310 sequences.


AT&T Labs Research