Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064232
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A064232
%S A064232 0,1,16,243,971,31469,32530,6799175,298900846,1381059609,144064988167,
%T A064232 7774410799163,72418038179852,6737865711858693,426377776285933636,
%U A064232 6292404967145601295,586165173437961392811,2993987233372099394609
%N A064232 n^(n+2) mod (n+1)^(n+1).
%H A064232 Harry J. Smith, <a href="b064232.txt">Table of n, a(n) for n=0,...,100</
               a>
%F A064232 a(n) = n^(n+2) mod (n+1)^(n+1)
%o A064232 (PARI) { for (n=0, 100, write("b064232.txt", n, " ", n^(n + 2) % (n + 
               1)^(n + 1)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               Sep 10 2009]
%Y A064232 Sequence in context: A058667 A005619 A135518 this_sequence A074153 A119933 
               A008788
%Y A064232 Adjacent sequences: A064229 A064230 A064231 this_sequence A064233 A064234 
               A064235
%K A064232 easy,nonn
%O A064232 0,3
%A A064232 Floor van Lamoen (fvlamoen(AT)hotmail.com), Sep 22 2001

    
page 1

Search completed in 0.001 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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research