The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by Vladimir Baltic (See also Vladimir Baltic's wiki page)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A003269

a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.
(history; published version)

#94 by Vladimir Baltic at Wed May 28 19:01:27 EDT 2014

STATUS

editing

proposed

Discussion

Wed May 28

19:44

Alois P. Heinz: Ok, yes, they are back.  Plus some new crossrefs.  Thanks.

#93 by Vladimir Baltic at Wed May 28 18:58:38 EDT 2014

CROSSREFS

Cf. A000045, A000079, A000930, A003520, A005708, A005709, A005710, A005711, A017898, A048718, A072827, A072850-A072856, A079955-A080014.

See A017898 for an essentially identical sequence.

STATUS

proposed

editing

Discussion

Wed May 28

19:01

Vladimir Baltic: I tried to put more crossrefs, but I delete all of them...
I think I've corrected it.

#92 by Vladimir Baltic at Wed May 28 14:24:25 EDT 2014

STATUS

editing

proposed

Discussion

Wed May 28

14:41

Alois P. Heinz: You deleted all the crossrefs, perhaps not a good idea.  But can you explain why?

#91 by Vladimir Baltic at Wed May 28 14:16:46 EDT 2014

CROSSREFS

Cf. A000045, A000079, A000930, A003520, A005708, A005709, A005710, A005711, A017898, A048718.

See A017898 for an essentially identical sequence.

STATUS

proposed

editing

Discussion

Wed May 28

14:24

Vladimir Baltic: I prefer 
"Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=3, I={1,2}."
than
"Number of permutations satisfying -1<=p(i)-i<=3 and p(i)-i not in {1,2}."
or 
"Number of permutations satisfying p(i)-i in {-1,0,3}."
as is the terminology used in my paper "On the number of certain types of strongly restricted permutations", Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135, as well as in seq.
A072827, A072850-A072856, A079955-A080014

#87 by Vladimir Baltic at Wed May 28 12:02:46 EDT 2014

STATUS

editing

proposed

Discussion

Wed May 28

12:16

Joerg Arndt: Better wording(?): "Number of permutations satisfying -1<=p(i)-i<=3 and p(i)-i not in {1,2}."  Alternatively, giving set of all allowed values for p(i)-i.

#86 by Vladimir Baltic at Sun May 18 21:38:47 EDT 2014

COMMENTS

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=3, I={1,2}. - Vladimir Baltic, Mar 07 2012

STATUS

approved

editing

Discussion

Mon May 26

01:22

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A003269 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server

A241975

Numbers n such that n^4 - n^3 - n - 1 is a semiprime.
(history; published version)

#2 by Vladimir Baltic at Sat May 03 15:01:05 EDT 2014

KEYWORD

allocating

allocated

A241976

Values of k such that k^2 + (k+3)^2 is a square.
(history; published version)

#1 by Vladimir Baltic at Sat May 03 15:01:05 EDT 2014

NAME

allocated for Vladimir Baltic

KEYWORD

allocated

STATUS

approved

A241977

Numbers k>1 such that 10^phi(k) == 1 (mod k^2), where phi(n)=A000010(n).
(history; published version)

#1 by Vladimir Baltic at Sat May 03 15:01:05 EDT 2014

NAME

allocated for Vladimir Baltic

KEYWORD

allocated

STATUS

approved

A241978

Numbers n such that 6^phi(n) == 1 (modulo n^2), where phi(n) is Euler's totient function.
(history; published version)

#1 by Vladimir Baltic at Sat May 03 15:01:05 EDT 2014

NAME

allocated for Vladimir Baltic

KEYWORD

allocated

STATUS

approved