|
|
A004767
|
|
a(n) = 4*n + 3.
|
|
194
|
|
|
3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 103, 107, 111, 115, 119, 123, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 167, 171, 175, 179, 183, 187, 191, 195, 199, 203, 207, 211, 215, 219, 223
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0(12).
Binary expansion ends 11.
These the numbers for which zeta(2*x+1) needs just 2 terms to be evaluated. - Jorge Coveiro, Dec 16 2004 [This comment needs clarification]
a(n) is the smallest k such that for every r from 0 to 2n - 1 there exist j and i, k >= j > i > 2n - 1, such that j - i == r (mod (2n - 1)), with (k, (2n - 1)) = (j,(2n - 1)) = (i, (2n - 1)) = 1. - Amarnath Murthy, Sep 24 2003
Any (4n+3)-dimensional manifold endowed with a mixed 3-Sasakian structure is an Einstein space with Einstein constant lambda = 4n + 2 [Theorem 3, p. 10 of Ianus et al.]. - Jonathan Vos Post, Nov 24 2008
Numbers n such that there are no primes p that satisfy the relationship p XOR n = p + n. - Brad Clardy, Jul 22 2012
All triangular numbers in the sequence are congruent to {3, 7} mod 8. - Ivan N. Ianakiev, Nov 12 2013
Apart from the initial term, length of minimal path on an n-dimensional cubic lattice (n > 1) of side length 2, until a self-avoiding walk gets stuck. Construct a path connecting all 2n points orthogonally adjacent from the center, ending at the center. Starting at any point adjacent to the center, there are 2 steps to reach each of the remaining 2n - 1 points, resulting in path length 4n - 2 with a final step connecting the center, for a total path length of 4n - 1, comprising 4n points. - Matthew Lehman, Dec 10 2013
For the Collatz Conjecture, we identify two types of odd numbers. This sequence contains all the ascenders: where (3*a(n) + 1) / 2 is odd and greater than a(n). See A016813 for the descenders. - Jaroslav Krizek, Jul 29 2016
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2*a(n-1) - a(n-2) for n > 1, a(0) = 3, a(1) = 7. - Philippe Deléham, Nov 03 2008
E.g.f.: (3 + 4*x)*exp(x).
Sum_{n >= 0} (-1)^n/a(n) = (Pi + 2*log(sqrt(2) - 1))/(4*sqrt(2)) = A181049. (End)
|
|
EXAMPLE
|
G.f. = 3 + 7*x + 11*x^2 + 15*x^3 + 19*x^4 + 23*x^5 + 27*x^6 + 31*x^7 + ...
|
|
MAPLE
|
seq( 3+4*n, n=0..100 );
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a004767 = (+ 3) . (* 4)
(PARI) Vec((3+x)/(1-x)^2 + O(x^200)) \\ Altug Alkan, Jan 15 2016
(Python) for n in range(0, 50): print(4*n+3, end=', ') # Stefano Spezia, Dec 12 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|