%I A008864
%S A008864 3,4,6,8,12,14,18,20,24,30,32,38,42,44,48,54,60,62,68,72,74,80,84,90,98,
%T A008864 102,104,108,110,114,128,132,138,140,150,152,158,164,168,174,180,182,192,
%U A008864 194,198,200,212,224,228,230,234,240,242,252,258,264,270,272,278,282,284
%N A008864 Primes + 1.
%C A008864 Number of divisors of 2^p = p+1 = A000005[A034785(n)] = A000203[A000040(n)]
= Sum of divisors of primes. - Labos E. (labos(AT)ana.sote.hu), May
24 2001
%C A008864 a(n) = A084920(n)/A006093(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com),
Aug 06 2007
%C A008864 Or, three together with nonprime numbers k such that k-1 is prime. -
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Sep 08 2009
%C A008864 Also, the sum of trivial divisors of nth prime . - Juri-Stepan Gerasimov
(2stepan(AT)rambler.ru), Sep 26 2009
%D A008864 C. W. Trigg, Problem #1210, Series Formation, J. Rec. Math., 15 (1982),
221-222.
%t A008864 Table[Prime[n]+1,{n,1,30}] - Vladimir Orlovsky, Apr 27 2008
%Y A008864 a(n) = p(n)+1 = A000040(n)+1=A000040(n)+A000012(n).
%Y A008864 Cf. A000040, A060800, A131991, A131992, A131993, A141468.
%Y A008864 Sequence in context: A050115 A167711 A037346 this_sequence A129295 A049305
A147606
%Y A008864 Adjacent sequences: A008861 A008862 A008863 this_sequence A008865 A008866
A008867
%K A008864 nonn
%O A008864 1,1
%A A008864 N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy
|