Search: id:A010692
Results 1-1 of 1 results found.

%I A010692
%S A010692 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%T A010692 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,
%U A010692 10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10
%N A010692 Constant sequence.
%C A010692 Also the representation of 2 in base 2 followed by 3 written in base 
               3, 4 in base 4, etc.
%C A010692 If A=[A158127] 100*n.^2+2*n (n>0, 102, 404, 906,.,. ,.,); Y=[A010692] 
               10 (10, 10, 10,.,); X=[A158128] 100*n+1 (n>0, 101, 201, 301, ,. .,
               ), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 
               101^2-102*10^2=1; 201^2-404*10^2=1; 301^2-906*10^2=1. [From Vincenzo 
               Librandi (vincenzo.librandi(AT)tin.it), Mar 13 2009]
%C A010692 If A=[A158129] 100*n.^2-2*n (n>0, 98, 396, 894,.,. ,.,); Y=[A010692] 
               10 (10, 10, 10,.,); X=[A044812] 100*n-1 (n>0, 99, 199, 299, ,. .,
               ), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 
               99^2-98*10^2=1; 199^2-396*10^2=1; 299^2-894*10^2=1. [From Vincenzo 
               Librandi (vincenzo.librandi(AT)tin.it), Mar 13 2009]
%H A010692 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A010692 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%Y A010692 Cf. A158127, A158128 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Mar 13 2009]
%Y A010692 Cf. A158129, A044812 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Mar 13 2009]
%Y A010692 Sequence in context: A131722 A072803 A163139 this_sequence A109751 A160941 
               A070565
%Y A010692 Adjacent sequences: A010689 A010690 A010691 this_sequence A010693 A010694 
               A010695
%K A010692 nonn
%O A010692 0,1
%A A010692 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds