Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152532
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A152532
%S A152532 4,11,41,69,161,213,353,505,655,1011,1197,1509,1841,2185,2667,3115,3831,
%T A152532 4197,4749,5463,5901,6865,7873,8795,9789,10601,11013,11873,13617,14549,
%U A152532 17137,17935,20135,20691,23091,24299,25893,27865
%N A152532 a(n) = p(n)*p(n+2) - 2*p(n+1), where p(n) is the n-th prime.
%H A152532 Ingo Althofer, <a href="http://www.littlegolem.net/jsp/forum/topic2.jsp?forum=1&topic=1830">
               Is 8795 a boring number?</a> [From Omar E. Pol (info(AT)polprimos.com), 
               Feb 20 2009]
%H A152532 C. Greathouse, <a href="http://math.crg4.com/uninteresting.html">Uninteresting 
               numbers</a>. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 
               30 2009]
%Y A152532 Cf. A000040, A111071, A152527, A152528, A152529, A152530, A152531.
%Y A152532 Sequence in context: A149267 A149268 A077236 this_sequence A121096 A047091 
               A121092
%Y A152532 Adjacent sequences: A152529 A152530 A152531 this_sequence A152533 A152534 
               A152535
%K A152532 easy,nonn
%O A152532 1,1
%A A152532 Omar E. Pol (info(AT)polprimos.com), Dec 06 2008

    
page 1

Search completed in 0.002 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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research