[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!)
Revisions by Alvin Hoover Belt (See also Alvin Hoover Belt's wiki page)

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A363421 a(n) = Sum_{k=0..n}(n^[not(k | n)] - n^[k | n]), where '[ ]' denotes the Iverson bracket.
(history; published version)
#7 by Alvin Hoover Belt at Thu Jun 01 16:57:54 EDT 2023
STATUS

editing

proposed

#6 by Alvin Hoover Belt at Thu Jun 01 16:55:24 EDT 2023
NAME

allocated for Alvin Hoover Belt

a(n)=n(n+1)(n+2)(n+3)(n+4)(n+5)/6

DATA

120, 840, 3360, 10080, 25200, 55440, 110880, 205920, 360360, 600600, 960960, 1485120, 2227680, 3255840, 4651200, 6511680, 8953560, 12113640, 16151520, 21252000, 27627600, 35521200, 45208800, 57002400, 71253000, 88353720, 108743040, 132908160, 161388480

OFFSET

1,1

PROG

(Python)

for n in range (0, 33):

print (n*(n+1)*(n+2)*(n+3)*(n+4)*(n+5))/6

CROSSREFS

cf. A000027 [ a(n)= n/1 ]

A000217 [ a(n)= n*(n+1)/2 ]

A033487 [ a(n)= n*(n+1)*(n+2)*(n+3)/4 ]

A158874 [ similar but 5 ]

KEYWORD

allocated

nonn,easy

AUTHOR

Alvin Hoover Belt, Jun 01 2023

STATUS

approved

editing

Discussion
Thu Jun 01 16:57
Alvin Hoover Belt: Pretty much the reason I did this was to tie similar sequences already in the OEIS together.  I think there are more, but I wasn't sure.
#5 by Alvin Hoover Belt at Thu Jun 01 16:55:24 EDT 2023
NAME

allocated for Alvin Hoover Belt

KEYWORD

recycled

allocated

A344601 a(n) = n^2 - A344533(n).
(history; published version)
#18 by Alvin Hoover Belt at Wed May 26 14:18:28 EDT 2021
COMMENTS

This is the number of hidden tresstrees (cf. A344533).

EXTENSIONS

Minor spelling error fixed by Alvin Hoover Belt, May 26 2021

STATUS

approved

editing

Discussion
Wed May 26 18:46
Kevin Ryde: No need for extension for this.
A307581 Position of the first permutation of { 0 .. n-1 } occurring in the digits of Pi written in base n.
(history; published version)
#13 by Alvin Hoover Belt at Wed Mar 17 21:22:52 EDT 2021
COMMENTS

By inspection, a(12) > 1000.._Alvin Hoover Belt_, Mar 17 2021

Discussion
Wed Mar 17 23:36
Jon E. Schoenfield: @Editors -- should the existing "_Alvin H. Belt_" signatures be changed to "_Alvin Hoover Belt_"?
A342279 A bisection of A000201: a(n) = A000201(2*n+1).
(history; published version)
#13 by Alvin Hoover Belt at Wed Mar 17 21:21:38 EDT 2021
PROG

print int(math.floor((2*n)+ 1) * phi), #_Alvin Hoover Belt_, Mar 17 2021~~),

#Alvin Hoover Belt, Mar 17 2021

Discussion
Wed Mar 17 21:26
Alvin Hoover Belt: I used the other account and I don't remember why I made a new one.  I suggested to someone else I forgot my password, but I seem to remember it being some other reason.
#12 by Alvin Hoover Belt at Wed Mar 17 08:34:40 EDT 2021
PROG

import math

phi = (1 + math.sqrt(5))/2

for n in range(0, 101):

print int(math.floor((2*n)+ 1) * phi), ), #_Alvin Hoover Belt_, Mar 17 2021~~

STATUS

proposed

editing

Discussion
Wed Mar 17 08:35
Michel Marcus: please remove the 2 extras ~~
14:19
Andrew Howroyd: You seem to have 2 user accounts? Also https://oeis.org/wiki/User:Alvin_H._Belt
A307581 Position of the first permutation of { 0 .. n-1 } occurring in the digits of Pi written in base n.
(history; published version)
#11 by Alvin Hoover Belt at Wed Mar 17 05:20:06 EDT 2021
STATUS

editing

proposed

Discussion
Wed Mar 17 06:46
Jon E. Schoenfield: Do you have two registered usernames?  Thanks.
08:31
Alvin Hoover Belt: Yes.  I forgot why I stopped using my first one.  Maybe I forgot the password?
A342279 A bisection of A000201: a(n) = A000201(2*n+1).
(history; published version)
#11 by Alvin Hoover Belt at Wed Mar 17 05:19:36 EDT 2021
STATUS

editing

proposed

Discussion
Wed Mar 17 06:46
Amiram Eldar: Please sign your program: add # ~~~~ at the end. See https://oeis.org/wiki/Style_Sheet#Programs
08:35
Michel Marcus: python says : IndentationError: expected an indented block
#10 by Alvin Hoover Belt at Wed Mar 17 05:19:13 EDT 2021
PROG

(Python)

import math

phi = (1 + math.sqrt(5))/2

for n in range(0, 101):

print int(math.floor((2*n)+ 1) * phi),

STATUS

approved

editing

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