login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078455 a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)). 0
2, 9, 55, 21, 792, 1937, 170, 4047, 115, 9454, 31930, 23902, 2665, 44978, 65189, 122483, 134992, 170983, 220028, 101104, 85556, 27887, 296725, 629141, 154327, 546208, 46865, 950588, 1043893, 1548891, 70739, 702946, 2389965, 1513988 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A subsequence of the mean of three consecutive numbers divisible by three consecutive primes (A-number?).

LINKS

Table of n, a(n) for n=1..34.

EXAMPLE

a(7) = 170. prime(7) = 17, prime(7-1) = 13, prime(7+1)=19 and 17 | 170, 19 | 171, 13 | 169 and 170 is the smallest such number.

MATHEMATICA

(* First do <<NumberTheory`NumberTheoryFunctions` *) a[1]=2; a[n_] := ChineseRemainder[{1, 0, Prime[n+1]-1}, Prime/@Range[n-1, n+1]]

CROSSREFS

Sequence in context: A075679 A001757 A267225 * A036074 A231172 A009363

Adjacent sequences:  A078452 A078453 A078454 * A078456 A078457 A078458

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy, Dec 23 2002

EXTENSIONS

More terms from Jim Nastos, Feb 19 2003 and Dean Hickerson, Feb 23 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 10:09 EST 2019. Contains 329334 sequences. (Running on oeis4.)