Search: id:A007535
Results 1-1 of 1 results found.
%I A007535 M5440
%S A007535 4,341,91,15,124,35,25,9,28,33,15,65,21,15,341,51,45,25,45,21,55,69,33,
%T A007535 25,28,27,65,45,35,49,49,33,85,35,51,91,45,39,95,91,105,205,77,45,76,
%U A007535 133,65,49,66,51,65,85,65,55,63,57,65,133,87,341,91,63,341,65,112,91
%N A007535 Smallest pseudoprime ( > n ) to base n: smallest composite number m >
n such that n^(m-1)-1 is divisible by m.
%C A007535 a(k-1) = k for odd composite numbers k = {9, 15, 21, 25, 27, 33, 35,
39, 45, 49, 51, ...} = A071904(n). - Alexander Adamchuk (alex(AT)kolmogorov.com),
Dec 13 2006
%D A007535 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A007535 A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964,
p. 42 (but beware errors in his table).
%H A007535 T. D. Noe, Table of n, a(n) for n=1..10000
%H A007535 G. P. Michon,
Pseudoprimes
%H A007535 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
a>
%H A007535 Wikipedia, Pseudoprime
a>
%H A007535 Index entries for sequences related
to pseudoprimes
%t A007535 f[n_] := Block[{k = n + 1}, While[PrimeQ[k] || PowerMod[n, k - 1, k]
!= 1, k++ ]; k]; Table[ f[n], {n, 67}] (from Robert G. Wilson v Sep
18 2004)
%Y A007535 Records in A098653 & A098654.
%Y A007535 Cf. A071904.
%Y A007535 Sequence in context: A135442 A086895 A090086 this_sequence A000783 A098654
A069884
%Y A007535 Adjacent sequences: A007532 A007533 A007534 this_sequence A007536 A007537
A007538
%K A007535 nonn,nice,easy
%O A007535 1,1
%A A007535 N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein, Robert G.
Wilson v (rgwv(AT)rgwv.com)
%E A007535 Corrected and extended by Patrick De Geest (pdg(AT)worldofnumbers.com),
10/2000.
Search completed in 0.002 seconds