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!)
A155499 a(n) = n + (n+1)^(n+2). 3
1, 9, 83, 1027, 15629, 279941, 5764807, 134217735, 3486784409, 100000000009, 3138428376731, 106993205379083, 3937376385699301, 155568095557812237, 6568408355712890639, 295147905179352825871 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

All the terms are evidently odd. If n is even, a(n) is (n+1) mod 8; if n is odd, a(n) is n mod 8.

Thus the sequence of remainders by dividing a(n) by 8 is given by 1, 1, 3, 3, 5, 5, 7, 7, 1, 1...

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

EXAMPLE

If n=2, a(2)=2+3^4=83.

MATHEMATICA

Table[n +(n+1)^(n+2), {n, 20}] (* or *) #[[1]]+#[[2]]^#[[3]]&/@ Partition[ Range[20], 3, 1] (* Harvey P. Dale, Mar 14 2012 *)

PROG

(PARI) a(n) = n+(n+1)^(n+2); \\ Michel Marcus, Feb 20 2016

CROSSREFS

Sequence in context: A015579 A162759 A147960 * A321294 A242596 A180807

Adjacent sequences:  A155496 A155497 A155498 * A155500 A155501 A155502

KEYWORD

nonn

AUTHOR

Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 23 2009

EXTENSIONS

Added the first term 1 by Vincenzo Librandi, Mar 15 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 October 25 20:21 EDT 2021. Contains 348256 sequences. (Running on oeis4.)