cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A155499 a(n) = n + (n+1)^(n+2).

Original entry on oeis.org

1, 9, 83, 1027, 15629, 279941, 5764807, 134217735, 3486784409, 100000000009, 3138428376731, 106993205379083, 3937376385699301, 155568095557812237, 6568408355712890639, 295147905179352825871
Offset: 0

Views

Author

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

Keywords

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

Examples

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

Programs

  • Mathematica
    Table[n +(n+1)^(n+2),{n,20}] (* or *) #[[1]]+#[[2]]^#[[3]]&/@ Partition[ Range[20],3,1] (* Harvey P. Dale, Mar 14 2012 *)
  • PARI
    a(n) = n+(n+1)^(n+2); \\ Michel Marcus, Feb 20 2016

Extensions

Added the first term 1 by Vincenzo Librandi, Mar 15 2012