login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181427 a(n) = n + [n^2 if n is odd or n^3 if n is even]. 1
2, 10, 12, 68, 30, 222, 56, 520, 90, 1010, 132, 1740, 182, 2758, 240, 4112, 306, 5850, 380, 8020, 462, 10670, 552, 13848, 650, 17602, 756, 21980, 870, 27030, 992, 32800, 1122, 39338, 1260, 46692, 1406, 54910, 1560, 64040, 1722, 74130, 1892, 85228, 2070 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(2k+1) = 2*A000384(k+1) (k in A001477). [From Bruno Berselli, Oct 20 2010]
LINKS
B. Berselli, Table of n, a(n) for n = 1..10000. [From Bruno Berselli, Oct 20 2010]
FORMULA
a(n) = n + n^{2(n mod 2)+3(1-(n mod 2)}.
a(n) = n + n^((5+(-1)^n)/2) = n*(1+A065679(n)).
G.f.: 2*x*(1+5*x+2x^2+14*x^3-3*x^4+5*x^5)/(1-x^2)^4.
a(n)-4*a(n-2)+6*a(n-4)-4*a(n-6)+a(n-8) = 0 for n>8.
a(2n)= A034262(2n). a(2n+1) = A002939(n+1).
EXAMPLE
For n=5, 5+5^2=30 and n=6 6+6^3=222.
MATHEMATICA
If[OddQ[ # ], #+#^2, #+#^3]&/@Range[50] (* Harvey P. Dale, Nov 03 2010 *)
CROSSREFS
Sequence in context: A080981 A106455 A209445 * A055697 A055705 A156430
KEYWORD
nonn,easy
AUTHOR
Dinesh Panchamia (dgpanchamia(AT)gmail.com), Oct 19 2010
EXTENSIONS
Formulas and more terms from R. J. Mathar and Bruno Berselli, Oct 19 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)