Search: id:A001039 Results 1-1 of 1 results found. %I A001039 M2964 N1199 %S A001039 3,13,781,137257,28531167061,25239592216021,51702516367896047761, %T A001039 109912203092239643840221,949112181811268728834319677753, %U A001039 91703076898614683377208150526107718802981 %N A001039 a(n) = (p^p-1)/(p-1) where p = prime(n). %D A001039 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A001039 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001039 W. F. Lunnon et al., Arithmetic properties of Bell numbers to a composite modulus I, Acta Arith., 35 (1979), 1-16. [From N. J. A. Sloane (njas(AT)research.att.com), Feb 07 2009] %D A001039 T. S. Motzkin, Sorting numbers ...: for a link to this paper see A000262. %D A001039 T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. %D A001039 J. Levine and R. E. Dalton, Minimum periods, modulo p, of first-order Bell exponential integers, Math. Comp., 16 (1962), 416-423. %H A001039 T. D. Noe, Table of n, a(n) for n=1..26 %p A001039 for i from 1 to 20 do printf(`%d,`,(ithprime(i)^ithprime(i) -1)/(ithprime(i)-1)) od: %t A001039 Table[(Prime[n]^Prime[n] - 1)/(Prime[n] - 1), {n, 1, 10}] %Y A001039 Cf. A054767. %Y A001039 Sequence in context: A066266 A092845 A089711 this_sequence A065831 A092540 A118628 %Y A001039 Adjacent sequences: A001036 A001037 A001038 this_sequence A001040 A001041 A001042 %K A001039 nonn,easy %O A001039 1,1 %A A001039 N. J. A. Sloane (njas(AT)research.att.com). %E A001039 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 10 2000 Search completed in 0.001 seconds