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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082801 Smallest multiple of 6 beginning with n. 6
12, 24, 30, 42, 54, 6, 72, 84, 90, 102, 114, 12, 132, 144, 150, 162, 174, 18, 192, 204, 210, 222, 234, 24, 252, 264, 270, 282, 294, 30, 312, 324, 330, 342, 354, 36, 372, 384, 390, 402, 414, 42, 432, 444, 450, 462, 474, 48, 492, 504, 510, 522, 534, 54, 552 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,2,0,0,0,0,0,-1).

FORMULA

G.f.: 6*x*(2 +4*x +5*x^2 +7*x^3 +9*x^4 +x^5 +8*x^6 +6*x^7 +5*x^8 +3*x^9 +x^10) / ((1-x)^2*(1+x)^2*(1-x+x^2)^2*(1+x+x^2)^2). [Bruno Berselli, Nov 12 2012]

a(n) = (9*t+1)*n + 2*t*(n mod 3), where t=1-A079979(n). [Bruno Berselli, Nov 12 2012]

MATHEMATICA

Table[If[Divisible[n, 6], n, First[Select[10n+{0, 2, 4}, Divisible[ #, 6]&]]], {n, 100}] (* Harvey P. Dale, Nov 12 2012 *)

Table[If[Mod[n, 6]==0, n, If[Mod[10 n, 6]==0, 10 n, 10 n + 6 - Mod[10 n, 6]]], {n, 60}] (* Vincenzo Librandi, Feb 10 2014 *)

CROSSREFS

Cf. A082799, A082800, A082802, A082803, A082804.

Sequence in context: A085236 A068567 A316099 * A328587 A328632 A261435

Adjacent sequences:  A082798 A082799 A082800 * A082802 A082803 A082804

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy, Apr 20 2003

EXTENSIONS

More terms from Harvey P. Dale, Nov 11 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 April 20 03:02 EDT 2021. Contains 343121 sequences. (Running on oeis4.)