Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063450
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063450 d[n+1] < 2d[n], d[]=A000005. +0
2
2, 3, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 36, 38, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 56, 57, 58, 60, 62, 63, 64, 66, 68, 70, 72, 74, 75, 76, 78, 80, 81, 82, 84, 85, 86, 88, 90, 91, 92, 93, 94, 96, 98, 99, 100, 102, 104, 105 (list; graph; listen)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

d(p+1)<2d(p) holds mainly to composites and also to 2 primes p=2,p=3 as well; n=10,2d[10]=2.4=8>2=d[11]; n=3,2d[3]=2.2=4>d[4]=3; 2d[2]=2.2=4>d[3]=2

PROGRAM

(PARI) { n=0; for (m=1, 10^9, if (numdiv(m + 1) < 2*numdiv(m), write("b063450.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 21 2009]

CROSSREFS

A000005.

Sequence in context: A125292 A101513 A108408 this_sequence A047229 A094229 A067290

Adjacent sequences: A063447 A063448 A063449 this_sequence A063451 A063452 A063453

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 24 2001

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research