Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063465 omega(n) = omega(n+3), where omega(n) is the number of distinct prime divisors of n. +0
1
2, 4, 5, 8, 12, 13, 15, 16, 18, 21, 29, 33, 35, 36, 45, 48, 51, 52, 54, 55, 61, 62, 64, 65, 69, 72, 74, 77, 82, 85, 88, 91, 92, 93, 95, 96, 102, 108, 112, 115, 116, 119, 125, 128, 133, 141, 142, 143, 144, 145, 152, 155, 158, 159, 161, 165, 172, 175, 184, 185, 189 (list; graph; listen)
OFFSET

1,1

LINKS

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

PROGRAM

(PARI) j=[]; for(n=1, 350, if(omega(n)==omega(n+3), j=concat(j, n))); j

(PARI) { n=0; for (m=1, 10^9, if (omega(m) == omega(m + 3), write("b063465.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 22 2009]

CROSSREFS

Sequence in context: A007379 A080588 A032850 this_sequence A035001 A092268 A069259

Adjacent sequences: A063462 A063463 A063464 this_sequence A063466 A063467 A063468

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 26 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research