Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064149
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064149 Numbers n such that A036263(n) = A036263(n+1), using signed version of A036263. +0
2
7, 11, 13, 18, 22, 49, 54, 58, 69, 70, 75, 85, 91, 104, 111, 116, 122, 123, 127, 132, 173, 182, 206, 210, 225, 226, 236, 244, 253, 256, 260, 269, 271, 275, 284, 299, 300, 309, 321, 328, 351, 364, 367, 375, 388, 390, 391, 395, 406, 411, 413, 420, 421, 422, 435 (list; graph; listen)
OFFSET

1,1

LINKS

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

PROGRAM

(PARI) { n=0; for (m=1, 10^9, if (prime(m) + 3*prime(m + 2) == 3*prime(m + 1) + prime(m + 3), write("b064149.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 09 2009]

CROSSREFS

Sequence in context: A032666 A153321 A060772 this_sequence A046289 A092246 A084468

Adjacent sequences: A064146 A064147 A064148 this_sequence A064150 A064151 A064152

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Sep 11 2001

page 1

Search completed in 0.072 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 14 16:07 EDT 2010. Contains 173425 sequences.


AT&T Labs Research