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!)
A028325 Odd elements to the right of the central elements of the 5-Pascal triangle A028313. 4
1, 1, 1, 7, 1, 19, 1, 27, 9, 1, 65, 1, 101, 11, 1, 231, 147, 57, 1, 69, 13, 1, 273, 1, 855, 355, 15, 1, 2277, 451, 111, 1, 5379, 3487, 1661, 127, 17, 1, 11583, 2223, 689, 1, 20449, 7371, 833, 19, 1, 43615, 34463, 21385, 10283, 3745, 995, 181, 1, 201, 21, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Odd elements of A028323. - G. C. Greubel, Jan 06 2024
LINKS
MATHEMATICA
A028313[n_, k_]:= If[n<2, 1, Binomial[n, k] + 3*Binomial[n-2, k-1]];
f= Table[A028313[n, k], {n, 0, 100}, {k, 1+Floor[n/2], n}]//Flatten;
b[n_]:= DeleteCases[{f[[n+1]]}, _?EvenQ];
Table[b[n], {n, 0, 150}]//Flatten (* G. C. Greubel, Jan 06 2024 *)
PROG
(Magma)
T:= func< n, k | Binomial(n+1, k+1+Floor((n+1)/2)) + 3*Binomial(n-1, k+Floor((n+1)/2)) >; // T = A028323, essentially
b:=[T(n, k): k in [0..Floor(n/2)], n in [0..100]];
[b[n]: n in [1..150] | (b[n] mod 2) eq 1]; // G. C. Greubel, Jan 06 2024
(SageMath)
def T(n, k): return binomial(n+1, k+1+(n+1)//2) + 3*binomial(n-1, k+((n+1)//2)) - 3*int(n==0) # T = A028323, essentially
b=flatten([[T(n, k) for k in range(1+(n//2))] for n in range(101)])
[b[n] for n in (1..150) if b[n]%2==1] # G. C. Greubel, Jan 06 2024
CROSSREFS
Sequence in context: A179530 A098081 A125234 * A245484 A215503 A371835
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from James A. Sellers
STATUS
approved

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)