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.

Previous Showing 11-12 of 12 results.

A256140 Square array read by antidiagonals upwards: T(n,k) = n^A000120(k), n>=0, k>=0.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 2, 1, 0, 1, 4, 3, 4, 1, 0, 1, 5, 4, 9, 2, 1, 0, 1, 6, 5, 16, 3, 4, 1, 0, 1, 7, 6, 25, 4, 9, 4, 1, 0, 1, 8, 7, 36, 5, 16, 9, 8, 1, 0, 1, 9, 8, 49, 6, 25, 16, 27, 2, 1, 0, 1, 10, 9, 64, 7, 36, 25, 64, 3, 4, 1, 0, 1, 11, 10, 81, 8, 49, 36, 125, 4, 9, 4, 1, 0, 1, 12, 11, 100, 9, 64, 49, 216, 5, 16, 9, 8, 1, 0
Offset: 0

Views

Author

Omar E. Pol, Mar 16 2015

Keywords

Comments

The partial sums of row n give the n-th row of the square array A256141.
First differs from A244003 at a(25).

Examples

			The corner of the square array with the first 16 terms of the first 12 rows looks like this:
---------------------------------------------------------------------------
A000007: 1, 0, 0,  0,  0,  0,  0,   0,  0,  0,  0,   0,  0,   0,   0,    0
A000012: 1, 1, 1,  1,  1,  1,  1,   1,  1,  1,  1,   1,  1,   1,   1,    1
A001316: 1, 2, 2,  4,  2,  4,  4,   8,  2,  4,  4,   8,  4,   8,   8,   16
A048883: 1, 3, 3,  9,  3,  9,  9,  27,  3,  9,  9,  27,  9,  27,  27,   81
A102376: 1, 4, 4, 16,  4, 16, 16,  64,  4, 16, 16,  64, 16,  64,  64,  256
A256135: 1, 5, 5, 25,  5, 25, 25, 125,  5, 25, 25, 125, 25, 125, 125,  625
A256136: 1, 6, 6, 36,  6, 36, 36, 216,  6, 36, 36, 216, 36, 216, 216, 1296
.......: 1, 7, 7, 49,  7, 49, 49, 343,  7, 49, 49, 343, 49, 343, 343, 2401
.......: 1, 8, 8, 64,  8, 64, 64, 512,  8, 64, 64, 512, 64, 512, 512, 4096
.......: 1, 9, 9, 81,  9, 81, 81, 729,  9, 81, 81, 729, 81, 729, 729, 6561
.......: 1,10,10,100, 10,100,100,1000, 10,100,100,1000,100,1000,1000,10000
.......: 1,11,11,121, 11,121,121,1331, 11,121,121,1331,121,1331,1331,14641
		

Crossrefs

A152915 Exponacci (or exponential Fibonacci) numbers.

Original entry on oeis.org

1, 1, 2, 9, 64, 3125, 1679616, 96889010407, 9223372036854775808, 278128389443693511257285776231761, 10000000000000000000000000000000000000000000000000000000
Offset: 0

Views

Author

ShaoJun Ying (dolphinysj(AT)gmail.com), Dec 15 2008

Keywords

Examples

			a(9) = 9 ^ Fibonacci(9) = 9 ^ 34 = 278128389443693511257285776231761.
		

Crossrefs

Main diagonal of A244003.

Programs

  • Magma
    [n^Fibonacci(n): n in [1..10]]; // Vincenzo Librandi, Apr 05 2017
  • Maple
    a:= n-> n^(<<1|1>, <1|0>>^n)[1, 2]:
    seq(a(n), n=0..12);  # Alois P. Heinz, Jun 17 2014
  • Mathematica
    Array[ #^Fibonacci[ # ]&,12] (* Vladimir Joseph Stephan Orlovsky, Apr 03 2010 *)
  • Other
    unsigned long Exponacci(unsigned int n)
    {
    if (n == 0)
    return 1;
    return pow(n, Fibonacci(n));
    }
    

Formula

a(0) = 1, a(n) = n ^ Fibonacci(n) for n > 0; Fibonacci = A000045.

Extensions

More terms from Vladimir Joseph Stephan Orlovsky, Apr 03 2010
Previous Showing 11-12 of 12 results.