[go: up one dir, main page]

login
Revision History for A193242 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = (C(n, floor(n/2)) + 2)^n for n >= 0.
(history; published version)
#37 by Alois P. Heinz at Tue Jun 26 16:00:01 EDT 2018
STATUS

editing

approved

#36 by Alois P. Heinz at Tue Jun 26 15:59:58 EDT 2018
DATA

1, 3, 16, 125, 4096, 248832, 113379904, 94931877133, 722204136308736, 9223372036854775808, 1117730665547154976408576, 214633637635011206805784100864, 397495155639882245867698528490622976, 1135797931555041090259334993227408493600768

STATUS

approved

editing

#35 by N. J. A. Sloane at Mon Feb 20 23:12:13 EST 2017
STATUS

proposed

approved

#34 by G. C. Greubel at Mon Feb 20 23:02:05 EST 2017
STATUS

editing

proposed

#33 by G. C. Greubel at Mon Feb 20 23:00:24 EST 2017
NAME

a(n) = (C(n, floor(n/2)) + 2)^n for n >= 0.

DATA

1, 3, 16, 125, 4096, 248832, 113379904, 94931877133, 2148541983608805523456, 500609261666673206194904576, 223991529323659151853921232282624, 783074711359940122081340283858644854784722204136308736, 9223372036854775808, 1117730665547154976408576, 214633637635011206805784100864, 397495155639882245867698528490622976

LINKS

G. C. Greubel, <a href="/A193242/b193242.txt">Table of n, a(n) for n = 0..59</a>

MATHEMATICA

Table[(Binomial[n, Floor[n/2]] + 2)^n, {n, 0, 20}] (* G. C. Greubel, Feb 20 2017 *)

PROG

(PARI) for(n=0, 20, print1((binomial(n, floor(n/2)) + 2)^n, ", ")) \\ G. C. Greubel, Feb 20 2017

EXTENSIONS

Corrected a(8) onward - G. C. Greubel, Feb 20 2017

STATUS

approved

editing

Discussion
Mon Feb 20
23:02
G. C. Greubel: The data for a(8) onward did not match the function in the title or the commented formulas. Corrected the data to match.
#32 by N. J. A. Sloane at Tue Apr 22 00:51:09 EDT 2014
STATUS

proposed

approved

#31 by Jon E. Schoenfield at Mon Apr 21 21:40:27 EDT 2014
STATUS

editing

proposed

#30 by Jon E. Schoenfield at Mon Apr 21 21:40:25 EDT 2014
NAME

(C(n, [floor(n/2]) ) + 2)^n for n >= 0.

COMMENTS

If the terms in each row of a Pascal's triangle (see the tabular presentation of A007318) 1, 1-1, 1-2-1, 1-3-3-1, 1-4-6-4-1, 1-5-10-10-5-1, 1-6-15-20-15-6-1, 1-7-21-35-35-21-7-1 be are concatenated (if necessary) and considered as palindromes, represented in different bases, then A051920(n) for n>=0 could be considered as the smallest base radix, for which those palindromes are comprised composed of single digits/letters. Those palindromes will look like: 1, 11, 121, 1331, 14641, 15AA51, 16FKF61, 17LZZL71, ... . Conversion of such palindromes from their above mentioned bases to decimal yields this sequence of the consecutive ascending powers. Such powers are enumerations of the rows in a Pascal's triangle, counting from 0, namely: 1, 3, 16, 125, 4096, 248832, 113379904, 94931877133, ... (that is 1^0, 3^1, 4^2, 5^3, 8^4, 12^5, 22^6, 37^7, ...). In general those powers could be described as (A051920(n)+1)^n for n >= 0. Another property of above discussed the palindromes discussed above is that the value of the sum of their digits/letters constitutes sum to 2^n.

STATUS

approved

editing

#29 by T. D. Noe at Wed Mar 06 01:23:43 EST 2013
STATUS

editing

approved

#28 by T. D. Noe at Wed Mar 06 01:23:39 EST 2013
FORMULA

a(n) = (A051920(n) + 1)^n.

a(n) = (A001405(n) + 2)^n.

STATUS

approved

editing