login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182455 a(0)=1, a(n) = (a(n-1) mod (n+2))*(n+2). 2
1, 3, 12, 10, 24, 21, 40, 36, 60, 55, 84, 78, 112, 105, 144, 136, 180, 171, 220, 210, 264, 253, 312, 300, 364, 351, 420, 406, 480, 465, 544, 528, 612, 595, 684, 666, 760, 741, 840, 820, 924, 903, 1012, 990, 1104, 1081, 1200, 1176, 1300, 1275, 1404 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

FORMULA

a(0)=1, a(n) = (a(n-1) mod (n+2))*(n+2).

For k>0, a(2*k)=(k+1)*(2*k+4), a(2*k+1)=(k+1)*(2*k+3).

EXAMPLE

a(5) = (a(4) mod 7)*7 = (24 mod 7)*7 = 3*7 = 21.

PROG

(Python)

a=1

for n in range(1, 55):

. print a,

. a = (a%(n+2)) * (n+2)

(Haskell)

a182455 n = a182455_list !! n

a182455_list = 1 : zipWith (*) (zipWith mod a182455_list [3..]) [3..]

-- Reinhard Zumkeller, May 01 2012

CROSSREFS

Cf. A093005 - a(n)=(a(n-1) mod (n+1))*(n+1).

Sequence in context: A038230 A292581 A207852 * A110345 A018999 A279305

Adjacent sequences:  A182452 A182453 A182454 * A182456 A182457 A182458

KEYWORD

nonn,easy

AUTHOR

Alex Ratushnyak, Apr 30 2012

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 December 5 05:13 EST 2021. Contains 349530 sequences. (Running on oeis4.)