[go: up one dir, main page]

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!)
Revision History for A337785 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A337785 Number of addition triangles whose sum is n (version 1).
(history; published version)
#31 by Joerg Arndt at Tue Sep 22 03:54:25 EDT 2020
STATUS

proposed

approved

#30 by Seiichi Manyama at Tue Sep 22 03:47:44 EDT 2020
STATUS

editing

proposed

#29 by Seiichi Manyama at Tue Sep 22 02:53:16 EDT 2020
KEYWORD

nonn,new,look

#28 by Seiichi Manyama at Tue Sep 22 02:52:18 EDT 2020
LINKS

Seiichi Manyama, <a href="/A337785/b337785.txt">Table of n, a(n) for n = 1..500</a>

STATUS

approved

editing

#27 by N. J. A. Sloane at Tue Sep 22 01:45:43 EDT 2020
STATUS

proposed

approved

#26 by Seiichi Manyama at Mon Sep 21 18:26:41 EDT 2020
STATUS

editing

proposed

#25 by Seiichi Manyama at Mon Sep 21 18:18:30 EDT 2020
PROG

def f(n, ary)

s = 0

ary = [1]

(n. - 1).times{|i|

s += ary.inject(:+)

ary = [0] + ary + [0]

ary = (10..n - 1 - i + 1).map{|j| ary[j - 1] + ary[j]} + 1] + 1}

sary

s_ary = f(s + 1)

sum = f( = (0..s + 1).inject(0){|t, m| t + s_ary[m] * a)[m]}

STATUS

proposed

editing

#24 by Seiichi Manyama at Mon Sep 21 16:10:50 EDT 2020
STATUS

editing

proposed

#23 by Seiichi Manyama at Mon Sep 21 16:09:38 EDT 2020
PROG

f_ary = (1..n - 1 / 2).map{|i| [i]}

STATUS

proposed

editing

#22 by Seiichi Manyama at Mon Sep 21 15:49:06 EDT 2020
STATUS

editing

proposed

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 August 30 23:33 EDT 2024. Contains 375550 sequences. (Running on oeis4.)