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!)
A155499 a(n) = n + (n+1)^(n+2). 3

%I #16 Feb 20 2016 06:18:56

%S 1,9,83,1027,15629,279941,5764807,134217735,3486784409,100000000009,

%T 3138428376731,106993205379083,3937376385699301,155568095557812237,

%U 6568408355712890639,295147905179352825871

%N a(n) = n + (n+1)^(n+2).

%C 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.

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

%H Vincenzo Librandi, <a href="/A155499/b155499.txt">Table of n, a(n) for n = 0..200</a>

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

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

%o (PARI) a(n) = n+(n+1)^(n+2); \\ _Michel Marcus_, Feb 20 2016

%K nonn

%O 0,2

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

%E Added the first term 1 by _Vincenzo Librandi_, Mar 15 2012

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 24 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)