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!)
A076132 a(1) = 1; for n > 1, a(n) = Sum{a(n-k)^k | 0<k<n}. 1
1, 1, 2, 4, 10, 36, 218, 2804, 108074, 20114564, 36066331898, 1729247065742228, 9575643422153401723466, 50068381739089423185661226445092, 5264344550636729304011557445558608029761914394 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..20

EXAMPLE

a(2) = a(1)^1 = 1^1 = 1.

a(3) = a(2)^1 + a(1)^2 = 1^1 + 1^2 = 2.

a(4) = a(3)^1 + a(2)^2 + a(1)^3 = 2^1 + 1^2 + 1^3 = 4.

a(5) = a(4)^1 + a(3)^2 + a(2)^3 + a(1)^4 = 4^1 + 2^2 + 1^3 + 1^4 = 10.

PROG

(Haskell)

a076132 n = a076132_list !! (n-1)

a076132_list = 1 : f [1] where

   f xs = y : f (y : xs) where y = sum $ zipWith (^) xs [1..]

-- Reinhard Zumkeller, Mar 10 2013

CROSSREFS

Sequence in context: A210778 A210779 A002577 * A047142 A081080 A109460

Adjacent sequences:  A076129 A076130 A076131 * A076133 A076134 A076135

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Oct 30 2002

EXTENSIONS

Corrected by Don Reble, Nov 20 2006

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 August 6 12:33 EDT 2020. Contains 336246 sequences. (Running on oeis4.)